Base | Representation |
---|---|
bin | 11101000111110111100… |
… | …001100001010101001110 |
3 | 21002022201220122102012010 |
4 | 131013313201201111032 |
5 | 230242142003133040 |
6 | 4131220145322050 |
7 | 264406251005043 |
oct | 35076741412516 |
9 | 7068656572163 |
10 | 2001312552270 |
11 | 70182a841829 |
12 | 283a4b636326 |
13 | 116952475815 |
14 | 6cc14d1b1ca |
15 | 370d334be80 |
hex | 1d1f786154e |
2001312552270 has 16 divisors (see below), whose sum is σ = 4803150125520. Its totient is φ = 533683347264.
The previous prime is 2001312552269. The next prime is 2001312552329. The reversal of 2001312552270 is 722552131002.
It is a super-2 number, since 2×20013125522702 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 66710418409 = 2001312552270 / (2 + 0 + 0 + 1 + 3 + 1 + 2 + 5 + 5 + 2 + 2 + 7 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33355209175 + ... + 33355209234.
It is an arithmetic number, because the mean of its divisors is an integer number (300196882845).
Almost surely, 22001312552270 is an apocalyptic number.
2001312552270 is an abundant number, since it is smaller than the sum of its proper divisors (2801837573250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001312552270 is a wasteful number, since it uses less digits than its factorization.
2001312552270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66710418419.
The product of its (nonzero) digits is 8400, while the sum is 30.
Adding to 2001312552270 its reverse (722552131002), we get a palindrome (2723864683272).
The spelling of 2001312552270 in words is "two trillion, one billion, three hundred twelve million, five hundred fifty-two thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •