Base | Representation |
---|---|
bin | 1001001101000100010011… |
… | …1101111000011011110000 |
3 | 1022211110202011121111201100 |
4 | 2103101010331320123300 |
5 | 2311301431101201000 |
6 | 33305035413204400 |
7 | 2063103340603113 |
oct | 223210475703360 |
9 | 38743664544640 |
10 | 10120100022000 |
11 | 3251a016a5151 |
12 | 1175415030700 |
13 | 585423c933b7 |
14 | 26db5b87057a |
15 | 1283a8aa4a00 |
hex | 93444f786f0 |
10120100022000 has 120 divisors (see below), whose sum is σ = 35346136073040. Its totient is φ = 2698693334400.
The previous prime is 10120100021971. The next prime is 10120100022041. The reversal of 10120100022000 is 22000102101.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 281095890 + ... + 281131889.
It is an arithmetic number, because the mean of its divisors is an integer number (294551133942).
Almost surely, 210120100022000 is an apocalyptic number.
10120100022000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10120100022000 is an abundant number, since it is smaller than the sum of its proper divisors (25226036051040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120100022000 is a wasteful number, since it uses less digits than its factorization.
10120100022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562227808 (or 562227789 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10120100022000 its reverse (22000102101), we get a palindrome (10142100124101).
The spelling of 10120100022000 in words is "ten trillion, one hundred twenty billion, one hundred million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •