Base | Representation |
---|---|
bin | 1001001100000000111010… |
… | …1110011000111100010000 |
3 | 1022202202001110021101002001 |
4 | 2103000032232120330100 |
5 | 2311002404042401000 |
6 | 33252444400003344 |
7 | 2061563141152636 |
oct | 223001656307420 |
9 | 38682043241061 |
10 | 10102010122000 |
11 | 324526939a575 |
12 | 1171a06900554 |
13 | 583800247564 |
14 | 26cd23121356 |
15 | 127b9a88e46a |
hex | 9300eb98f10 |
10102010122000 has 40 divisors (see below), whose sum is σ = 24426660479832. Its totient is φ = 4040804048000.
The previous prime is 10102010121991. The next prime is 10102010122031. The reversal of 10102010122000 is 22101020101.
It can be written as a sum of positive squares in 4 ways, for example, as 178905312784 + 9923104809216 = 422972^2 + 3150096^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 2525500531 + ... + 2525504530.
Almost surely, 210102010122000 is an apocalyptic number.
10102010122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10102010122000 is an abundant number, since it is smaller than the sum of its proper divisors (14324650357832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102010122000 is an equidigital number, since it uses as much as digits as its factorization.
10102010122000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5051005084 (or 5051005068 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10102010122000 its reverse (22101020101), we get a palindrome (10124111142101).
The spelling of 10102010122000 in words is "ten trillion, one hundred two billion, ten million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •