Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0011110011111100111000 |
3 | 1022102002022220010121201022 |
4 | 2101202022003303330320 |
5 | 2302324022012320440 |
6 | 33134221313042012 |
7 | 2051356051255352 |
oct | 221421203637470 |
9 | 38362286117638 |
10 | 10001000120120 |
11 | 320644492a079 |
12 | 1156316856308 |
13 | 577123408289 |
14 | 26809dcac0d2 |
15 | 125237b49cb5 |
hex | 9188a0f3f38 |
10001000120120 has 32 divisors (see below), whose sum is σ = 22708692943200. Its totient is φ = 3963699128448.
The previous prime is 10001000120107. The next prime is 10001000120143. The reversal of 10001000120120 is 2102100010001.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a junction number, because it is equal to n+sod(n) for n = 10001000120098 and 10001000120107.
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, 1146899324 + ... + 1146908043.
It is an arithmetic number, because the mean of its divisors is an integer number (709646654475).
Almost surely, 210001000120120 is an apocalyptic number.
10001000120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001000120120 is an abundant number, since it is smaller than the sum of its proper divisors (12707692823080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001000120120 is a wasteful number, since it uses less digits than its factorization.
10001000120120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2293807487 (or 2293807483 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10001000120120 its reverse (2102100010001), we get a palindrome (12103100130121).
The spelling of 10001000120120 in words is "ten trillion, one billion, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •