Base | Representation |
---|---|
bin | 10111001111010111100110… |
… | …110111010011011011111000 |
3 | 111101220021222222001001222211 |
4 | 113033113212313103123320 |
5 | 101344112024230000440 |
6 | 1001215103123024504 |
7 | 30346342032054364 |
oct | 2717274667233370 |
9 | 441807888031884 |
10 | 102211210000120 |
11 | 2a62759244a171 |
12 | b56927350b134 |
13 | 450562529ca40 |
14 | 1b350984ba2a4 |
15 | bc3b34e42eea |
hex | 5cf5e6dd36f8 |
102211210000120 has 64 divisors (see below), whose sum is σ = 247673397132000. Its totient is φ = 37738339250688.
The previous prime is 102211210000087. The next prime is 102211210000171. The reversal of 102211210000120 is 21000012112201.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 102211210000120.
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, 13586611 + ... + 19723549.
Almost surely, 2102211210000120 is an apocalyptic number.
102211210000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102211210000120 is an abundant number, since it is smaller than the sum of its proper divisors (145462187131880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211210000120 is a wasteful number, since it uses less digits than its factorization.
102211210000120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6168992 (or 6168988 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102211210000120 its reverse (21000012112201), we get a palindrome (123211222112321).
The spelling of 102211210000120 in words is "one hundred two trillion, two hundred eleven billion, two hundred ten million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •