Base | Representation |
---|---|
bin | 10111001100100110101010… |
… | …000011000100001001001100 |
3 | 111101020010120121121111211222 |
4 | 113030212222003010021030 |
5 | 101333003420021041022 |
6 | 1000551521455302512 |
7 | 30326534501133113 |
oct | 2714465203041114 |
9 | 441203517544758 |
10 | 102021211112012 |
11 | 2a563a52a923a5 |
12 | b53848921aa38 |
13 | 44c0735c6a16a |
14 | 1b29bd276ac7a |
15 | bbdc149eb242 |
hex | 5cc9aa0c424c |
102021211112012 has 12 divisors (see below), whose sum is σ = 187933809943320. Its totient is φ = 48325836842496.
The previous prime is 102021211111979. The next prime is 102021211112017. The reversal of 102021211112012 is 210211112120201.
It is a super-2 number, since 2×1020212111120122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102021211112017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 671192178293 + ... + 671192178444.
It is an arithmetic number, because the mean of its divisors is an integer number (15661150828610).
Almost surely, 2102021211112012 is an apocalyptic number.
It is an amenable number.
102021211112012 is a deficient number, since it is larger than the sum of its proper divisors (85912598831308).
102021211112012 is a wasteful number, since it uses less digits than its factorization.
102021211112012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1342384356760 (or 1342384356758 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102021211112012 its reverse (210211112120201), we get a palindrome (312232323232213).
The spelling of 102021211112012 in words is "one hundred two trillion, twenty-one billion, two hundred eleven million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •