Base | Representation |
---|---|
bin | 11101000111110010101… |
… | …110010010011011010011 |
3 | 21002022112022002121002121 |
4 | 131013302232102123103 |
5 | 230242010343404021 |
6 | 4131204151155111 |
7 | 264404252304520 |
oct | 35076256223323 |
9 | 7068468077077 |
10 | 2001232013011 |
11 | 701799332460 |
12 | 283a28675a97 |
13 | 11693b886b5a |
14 | 6cc08354147 |
15 | 370cb23d741 |
hex | 1d1f2b926d3 |
2001232013011 has 32 divisors (see below), whose sum is σ = 2563697664000. Its totient is φ = 1516532284800.
The previous prime is 2001232012991. The next prime is 2001232013087. The reversal of 2001232013011 is 1103102321002.
It is a cyclic number.
It is not a de Polignac number, because 2001232013011 - 239 = 1451476199123 is a prime.
It is a super-2 number, since 2×20012320130112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2001232013411) 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 in 31 ways as a sum of consecutive naturals, for example, 5847865 + ... + 6180613.
It is an arithmetic number, because the mean of its divisors is an integer number (80115552000).
Almost surely, 22001232013011 is an apocalyptic number.
2001232013011 is a deficient number, since it is larger than the sum of its proper divisors (562465650989).
2001232013011 is a wasteful number, since it uses less digits than its factorization.
2001232013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334915.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 2001232013011 its reverse (1103102321002), we get a palindrome (3104334334013).
It can be divided in two parts, 20012 and 32013011, that added together give a palindrome (32033023).
The spelling of 2001232013011 in words is "two trillion, one billion, two hundred thirty-two million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •