Base | Representation |
---|---|
bin | 10111000000110011001011… |
… | …010110110100100001111000 |
3 | 111021100120202101112021202012 |
4 | 113000303023112310201320 |
5 | 101231211110401320440 |
6 | 555131124122425052 |
7 | 30214116450023033 |
oct | 2700631326644170 |
9 | 437316671467665 |
10 | 101210021120120 |
11 | 2a280a24423120 |
12 | b42721b362188 |
13 | 44620aa904313 |
14 | 1adc83c1da01a |
15 | ba7a8913ae65 |
hex | 5c0ccb5b4878 |
101210021120120 has 64 divisors (see below), whose sum is σ = 256990962751200. Its totient is φ = 35534552865280.
The previous prime is 101210021120081. The next prime is 101210021120129. The reversal of 101210021120120 is 21021120012101.
It is a junction number, because it is equal to n+sod(n) for n = 101210021120095 and 101210021120104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210021120129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3965897159 + ... + 3965922678.
Almost surely, 2101210021120120 is an apocalyptic number.
101210021120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101210021120120 is an abundant number, since it is smaller than the sum of its proper divisors (155780941631080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210021120120 is a wasteful number, since it uses less digits than its factorization.
101210021120120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7931819888 (or 7931819884 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101210021120120 its reverse (21021120012101), we get a palindrome (122231141132221).
The spelling of 101210021120120 in words is "one hundred one trillion, two hundred ten billion, twenty-one million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •