Base | Representation |
---|---|
bin | 100011110011000… |
… | …1101101110011111 |
3 | 10002201021021200001 |
4 | 1013212031232133 |
5 | 4430001400111 |
6 | 315105515131 |
7 | 41524013623 |
oct | 10746155637 |
9 | 3081237601 |
10 | 1201200031 |
11 | 5670563a9 |
12 | 296342aa7 |
13 | 161b24765 |
14 | b5763183 |
15 | 706c61c1 |
hex | 4798db9f |
1201200031 has 2 divisors, whose sum is σ = 1201200032. Its totient is φ = 1201200030.
The previous prime is 1201200029. The next prime is 1201200037. The reversal of 1201200031 is 1300021021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1201200031 - 21 = 1201200029 is a prime.
It is a super-2 number, since 2×12012000312 = 2885763028948801922, which contains 22 as substring.
Together with 1201200029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1201199990 and 1201200017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201200037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600600015 + 600600016.
It is an arithmetic number, because the mean of its divisors is an integer number (600600016).
Almost surely, 21201200031 is an apocalyptic number.
1201200031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201200031 is an equidigital number, since it uses as much as digits as its factorization.
1201200031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1201200031 is about 34658.3327787128. The cubic root of 1201200031 is about 1063.0126798426.
Adding to 1201200031 its reverse (1300021021), we get a palindrome (2501221052).
The spelling of 1201200031 in words is "one billion, two hundred one million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •