Base | Representation |
---|---|
bin | 10001011101101100111… |
… | …011000100100010111111 |
3 | 11020201201122201101211021 |
4 | 101131230323010202333 |
5 | 124130323031100111 |
6 | 2315155023205011 |
7 | 152464113510235 |
oct | 21355473044277 |
9 | 4221648641737 |
10 | 1200123300031 |
11 | 422a73352247 |
12 | 174712a46767 |
13 | 8922bcc89c6 |
14 | 4212ca62955 |
15 | 21340943d71 |
hex | 1176cec48bf |
1200123300031 has 2 divisors, whose sum is σ = 1200123300032. Its totient is φ = 1200123300030.
The previous prime is 1200123299957. The next prime is 1200123300037. The reversal of 1200123300031 is 1300033210021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1200123300031 - 219 = 1200122775743 is a prime.
It is a super-2 number, since 2×12001233000312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1200123299978 and 1200123300014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200123300037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600061650015 + 600061650016.
It is an arithmetic number, because the mean of its divisors is an integer number (600061650016).
Almost surely, 21200123300031 is an apocalyptic number.
1200123300031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200123300031 is an equidigital number, since it uses as much as digits as its factorization.
1200123300031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1200123300031 its reverse (1300033210021), we get a palindrome (2500156510052).
The spelling of 1200123300031 in words is "one trillion, two hundred billion, one hundred twenty-three million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •