Base | Representation |
---|---|
bin | 111011101000111… |
… | …1110100001001111 |
3 | 12011110121120000010 |
4 | 1313101332201033 |
5 | 13044301414411 |
6 | 530324404303 |
7 | 100406633631 |
oct | 16721764117 |
9 | 5143546003 |
10 | 2001201231 |
11 | 937698117 |
12 | 47a246693 |
13 | 25b7a8053 |
14 | 14dacca51 |
15 | baa4d7a6 |
hex | 7747e84f |
2001201231 has 16 divisors (see below), whose sum is σ = 2761976160. Its totient is φ = 1287336960.
The previous prime is 2001201229. The next prime is 2001201233. The reversal of 2001201231 is 1321021002.
It is an interprime number because it is at equal distance from previous prime (2001201229) and next prime (2001201233).
It is not a de Polignac number, because 2001201231 - 21 = 2001201229 is a prime.
It is a super-2 number, since 2×20012012312 = 8009612733911830722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001201233) 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 in 15 ways as a sum of consecutive naturals, for example, 156811 + ... + 169091.
It is an arithmetic number, because the mean of its divisors is an integer number (172623510).
Almost surely, 22001201231 is an apocalyptic number.
2001201231 is a deficient number, since it is larger than the sum of its proper divisors (760774929).
2001201231 is a wasteful number, since it uses less digits than its factorization.
2001201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14186.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 2001201231 is about 44734.7877048724. The cubic root of 2001201231 is about 1260.1732421152.
Adding to 2001201231 its reverse (1321021002), we get a palindrome (3322222233).
The spelling of 2001201231 in words is "two billion, one million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •