Base | Representation |
---|---|
bin | 101111110001100010000011… |
… | …001111111011001000111010 |
3 | 1000112221111210200121000101110 |
4 | 233301202003033323020322 |
5 | 210014433340020010020 |
6 | 2022512042104301150 |
7 | 62154043166133030 |
oct | 5761420317731072 |
9 | 1015844720530343 |
10 | 210112002110010 |
11 | 60a47aaa645350 |
12 | 1b6951444717b6 |
13 | 9031627649b80 |
14 | 39c5691bc0550 |
15 | 1945766c578e0 |
hex | bf18833fb23a |
210112002110010 has 512 divisors, whose sum is σ = 697012374675456. Its totient is φ = 39118754304000.
The previous prime is 210112002110009. The next prime is 210112002110033. The reversal of 210112002110010 is 10011200211012.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 467552725 + ... + 468001895.
It is an arithmetic number, because the mean of its divisors is an integer number (1361352294288).
Almost surely, 2210112002110010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 210112002110010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (348506187337728).
210112002110010 is an abundant number, since it is smaller than the sum of its proper divisors (486900372565446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210112002110010 is a wasteful number, since it uses less digits than its factorization.
210112002110010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 449670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210112002110010 its reverse (10011200211012), we get a palindrome (220123202321022).
It can be divided in two parts, 210112002 and 110010, that added together give a palindrome (210222012).
The spelling of 210112002110010 in words is "two hundred ten trillion, one hundred twelve billion, two million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •