Base | Representation |
---|---|
bin | 10111001101111010011101… |
… | …110100010001100000011100 |
3 | 111101112201212002222220121100 |
4 | 113031322131310101200130 |
5 | 101340442214224034322 |
6 | 1001101123210233100 |
7 | 30336201506010060 |
oct | 2715723564214034 |
9 | 441481762886540 |
10 | 102111200221212 |
11 | 2a599131545026 |
12 | b551a02425790 |
13 | 44c9077748280 |
14 | 1b302cc031aa0 |
15 | bc122ee25dac |
hex | 5cde9dd1181c |
102111200221212 has 72 divisors (see below), whose sum is σ = 317679289587296. Its totient is φ = 26930426431104.
The previous prime is 102111200221201. The next prime is 102111200221249. The reversal of 102111200221212 is 212122002111201.
102111200221212 is a `hidden beast` number, since 1 + 0 + 21 + 11 + 200 + 221 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15584734243 + ... + 15584740794.
Almost surely, 2102111200221212 is an apocalyptic number.
102111200221212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102111200221212 is an abundant number, since it is smaller than the sum of its proper divisors (215568089366084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111200221212 is a wasteful number, since it uses less digits than its factorization.
102111200221212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31169475067 (or 31169475062 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 102111200221212 its reverse (212122002111201), we get a palindrome (314233202332413).
The spelling of 102111200221212 in words is "one hundred two trillion, one hundred eleven billion, two hundred million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •