Base | Representation |
---|---|
bin | 10111000000101011111001… |
… | …001111100000011011011000 |
3 | 111021022211120101122001020212 |
4 | 113000223321033200123120 |
5 | 101231044101430120440 |
6 | 555123352130510252 |
7 | 30213421612203464 |
oct | 2700537117403330 |
9 | 437284511561225 |
10 | 101202201020120 |
11 | 2a27868115a262 |
12 | b4257b8435388 |
13 | 446143272b705 |
14 | 1adc2d97a14a4 |
15 | ba777c829465 |
hex | 5c0af93e06d8 |
101202201020120 has 32 divisors (see below), whose sum is σ = 227706846483600. Its totient is φ = 40480543663488.
The previous prime is 101202201020113. The next prime is 101202201020149. The reversal of 101202201020120 is 21020102202101.
It is a junction number, because it is equal to n+sod(n) for n = 101202201020095 and 101202201020104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5626535 + ... + 15299094.
Almost surely, 2101202201020120 is an apocalyptic number.
101202201020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101202201020120 is an abundant number, since it is smaller than the sum of its proper divisors (126504645463480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202201020120 is a wasteful number, since it uses less digits than its factorization.
101202201020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21046547 (or 21046543 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101202201020120 its reverse (21020102202101), we get a palindrome (122222303222221).
The spelling of 101202201020120 in words is "one hundred one trillion, two hundred two billion, two hundred one million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •