Base | Representation |
---|---|
bin | 10111000000111100011110… |
… | …010001001111101101101000 |
3 | 111021101112111222111201002012 |
4 | 113000330132101033231220 |
5 | 101231342031014231440 |
6 | 555135454345455052 |
7 | 30214622003665646 |
oct | 2700743621175550 |
9 | 437345458451065 |
10 | 101220002102120 |
11 | 2a285186428680 |
12 | b429145aa1488 |
13 | 446300b693325 |
14 | 1add107a0c196 |
15 | ba7e704dde65 |
hex | 5c0f1e44fb68 |
101220002102120 has 64 divisors (see below), whose sum is σ = 248450207731200. Its totient is φ = 36807108801280.
The previous prime is 101220002102057. The next prime is 101220002102143. The reversal of 101220002102120 is 21201200022101.
It is a junction number, because it is equal to n+sod(n) for n = 101220002102095 and 101220002102104.
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, 143985641 + ... + 144686919.
It is an arithmetic number, because the mean of its divisors is an integer number (3882034495800).
Almost surely, 2101220002102120 is an apocalyptic number.
101220002102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101220002102120 is an abundant number, since it is smaller than the sum of its proper divisors (147230205629080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101220002102120 is a wasteful number, since it uses less digits than its factorization.
101220002102120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1029338 (or 1029334 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101220002102120 its reverse (21201200022101), we get a palindrome (122421202124221).
The spelling of 101220002102120 in words is "one hundred one trillion, two hundred twenty billion, two million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •