Base | Representation |
---|---|
bin | 10111001111001110010010… |
… | …111000001110001101011000 |
3 | 111101212100012010012021001020 |
4 | 113033032102320032031120 |
5 | 101343431040010120440 |
6 | 1001210331014122440 |
7 | 30345536166121242 |
oct | 2717162270161530 |
9 | 441770163167036 |
10 | 102201211020120 |
11 | 2a623321271533 |
12 | b567342950420 |
13 | 45046c087b924 |
14 | 1b347ca541092 |
15 | bc374c1d73d0 |
hex | 5cf392e0e358 |
102201211020120 has 64 divisors (see below), whose sum is σ = 324639140893920. Its totient is φ = 25650500020224.
The previous prime is 102201211020113. The next prime is 102201211020143. The reversal of 102201211020120 is 21020112102201.
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 102201211020120.
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, 25049314387 + ... + 25049318466.
Almost surely, 2102201211020120 is an apocalyptic number.
102201211020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102201211020120 is an abundant number, since it is smaller than the sum of its proper divisors (222437929873800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102201211020120 is a wasteful number, since it uses less digits than its factorization.
102201211020120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50098632884 (or 50098632880 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102201211020120 its reverse (21020112102201), we get a palindrome (123221323122321).
The spelling of 102201211020120 in words is "one hundred two trillion, two hundred one billion, two hundred eleven million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •