Base | Representation |
---|---|
bin | 11101000111101000110… |
… | …101111000000101111110 |
3 | 21002022002202010221202100 |
4 | 131013220311320011332 |
5 | 230241140423331032 |
6 | 4131135510005530 |
7 | 264400200211530 |
oct | 35075065700576 |
9 | 7068082127670 |
10 | 2001066230142 |
11 | 7017137a0321 |
12 | 2839a10468a6 |
13 | 116913420195 |
14 | 6cbd031b850 |
15 | 370bb8e297c |
hex | 1d1e8d7817e |
2001066230142 has 96 divisors (see below), whose sum is σ = 5128920388800. Its totient is φ = 551691270144.
The previous prime is 2001066230101. The next prime is 2001066230153. The reversal of 2001066230142 is 2410326601002.
2001066230142 is a `hidden beast` number, since 20 + 0 + 1 + 0 + 6 + 623 + 0 + 14 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 6039484 + ... + 6362192.
It is an arithmetic number, because the mean of its divisors is an integer number (53426254050).
Almost surely, 22001066230142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2001066230142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2564460194400).
2001066230142 is an abundant number, since it is smaller than the sum of its proper divisors (3127854158658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001066230142 is a wasteful number, since it uses less digits than its factorization.
2001066230142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324450 (or 324447 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The spelling of 2001066230142 in words is "two trillion, one billion, sixty-six million, two hundred thirty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •