Base | Representation |
---|---|
bin | 100111000110101… |
… | …0011111000000011 |
3 | 10101102222012110121 |
4 | 1032031103320003 |
5 | 10141400042011 |
6 | 334111041111 |
7 | 44341524541 |
oct | 11615237003 |
9 | 3342865417 |
10 | 1312112131 |
11 | 6137202a0 |
12 | 307510197 |
13 | 17bab9015 |
14 | c6394d91 |
15 | 7a2d3e71 |
hex | 4e353e03 |
1312112131 has 4 divisors (see below), whose sum is σ = 1431395064. Its totient is φ = 1192829200.
The previous prime is 1312112117. The next prime is 1312112143.
It is a happy number.
1312112131 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1312112131 - 213 = 1312103939 is a prime.
It is a super-2 number, since 2×13121121312 = 3443276488634722322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1312112161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 59641450 + ... + 59641471.
It is an arithmetic number, because the mean of its divisors is an integer number (357848766).
Almost surely, 21312112131 is an apocalyptic number.
1312112131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1312112131 is a deficient number, since it is larger than the sum of its proper divisors (119282933).
1312112131 is a wasteful number, since it uses less digits than its factorization.
1312112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119282932.
The product of its digits is 36, while the sum is 16.
The square root of 1312112131 is about 36223.0883691604. The cubic root of 1312112131 is about 1094.7719216661.
It can be divided in two parts, 13121 and 12131, that added together give a palindrome (25252).
The spelling of 1312112131 in words is "one billion, three hundred twelve million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •