Base | Representation |
---|---|
bin | 10111000000111101100101… |
… | …101111011100001111111000 |
3 | 111021101122121112211012022020 |
4 | 113000331211233130033320 |
5 | 101231402010001400440 |
6 | 555140213342354440 |
7 | 30214663504106331 |
oct | 2700754557341770 |
9 | 437348545735266 |
10 | 101221201200120 |
11 | 2a285741278761 |
12 | b42941b58ba20 |
13 | 446316cc30081 |
14 | 1add1bcd85288 |
15 | ba7ee08ec3d0 |
hex | 5c0f65bdc3f8 |
101221201200120 has 64 divisors (see below), whose sum is σ = 314134762356000. Its totient is φ = 26061550652928.
The previous prime is 101221201200101. The next prime is 101221201200131. The reversal of 101221201200120 is 21002102122101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101221201200120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14543272555 + ... + 14543279514.
Almost surely, 2101221201200120 is an apocalyptic number.
101221201200120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101221201200120 is an abundant number, since it is smaller than the sum of its proper divisors (212913561155880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221201200120 is a wasteful number, since it uses less digits than its factorization.
101221201200120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29086552112 (or 29086552108 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101221201200120 its reverse (21002102122101), we get a palindrome (122223303322221).
The spelling of 101221201200120 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred one million, two hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •