Base | Representation |
---|---|
bin | 101111100000001100… |
… | …0111001101111000101 |
3 | 100202022101120121001110 |
4 | 1133000120321233011 |
5 | 3132410033014341 |
6 | 114510315115233 |
7 | 10240644463164 |
oct | 1370030715705 |
9 | 322271517043 |
10 | 102012001221 |
11 | 3a29912a429 |
12 | 1792b742b19 |
13 | 98095c9500 |
14 | 4d1a3613db |
15 | 29c0bbd216 |
hex | 17c0639bc5 |
102012001221 has 24 divisors (see below), whose sum is σ = 147305519136. Its totient is φ = 62767273920.
The previous prime is 102012001207. The next prime is 102012001253. The reversal of 102012001221 is 122100210201.
It is not a de Polignac number, because 102012001221 - 27 = 102012001093 is a prime.
It is a super-2 number, since 2×1020120012212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102012001197 and 102012001206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102012001121) 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 23 ways as a sum of consecutive naturals, for example, 5151886 + ... + 5171648.
It is an arithmetic number, because the mean of its divisors is an integer number (6137729964).
Almost surely, 2102012001221 is an apocalyptic number.
It is an amenable number.
102012001221 is a deficient number, since it is larger than the sum of its proper divisors (45293517915).
102012001221 is a wasteful number, since it uses less digits than its factorization.
102012001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29973 (or 29960 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102012001221 its reverse (122100210201), we get a palindrome (224112211422).
The spelling of 102012001221 in words is "one hundred two billion, twelve million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •