Base | Representation |
---|---|
bin | 11101000111110110110… |
… | …101110110000110100100 |
3 | 21002022201010002201202112 |
4 | 131013312311312012210 |
5 | 230242131040244022 |
6 | 4131215100100152 |
7 | 264406051461221 |
oct | 35076665660644 |
9 | 7068633081675 |
10 | 2001301103012 |
11 | 701824331832 |
12 | 283a47834658 |
13 | 11694cc97403 |
14 | 6cc135ba948 |
15 | 370d23398e2 |
hex | 1d1f6d761a4 |
2001301103012 has 6 divisors (see below), whose sum is σ = 3502276930278. Its totient is φ = 1000650551504.
The previous prime is 2001301103003. The next prime is 2001301103017. The reversal of 2001301103012 is 2103011031002.
It can be written as a sum of positive squares in only one way, i.e., 1706121866596 + 295179236416 = 1306186^2 + 543304^2 .
It is a super-2 number, since 2×20013011030122 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2001301103017) 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, 250162637873 + ... + 250162637880.
It is an arithmetic number, because the mean of its divisors is an integer number (583712821713).
Almost surely, 22001301103012 is an apocalyptic number.
It is an amenable number.
2001301103012 is a deficient number, since it is larger than the sum of its proper divisors (1500975827266).
2001301103012 is a wasteful number, since it uses less digits than its factorization.
2001301103012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500325275757 (or 500325275755 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2001301103012 its reverse (2103011031002), we get a palindrome (4104312134014).
The spelling of 2001301103012 in words is "two trillion, one billion, three hundred one million, one hundred three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •