Base | Representation |
---|---|
bin | 10111001100100111011001… |
… | …101111001111010000010100 |
3 | 111101020012122101011021001122 |
4 | 113030213121233033100110 |
5 | 101333012034333033022 |
6 | 1000552133120343112 |
7 | 30326563355012321 |
oct | 2714473157172024 |
9 | 441205571137048 |
10 | 102022011221012 |
11 | 2a564323698103 |
12 | b538671174a98 |
13 | 44c083295a83c |
14 | 1b29c6ab23b48 |
15 | bbdc5ed95742 |
hex | 5cc9d9bcf414 |
102022011221012 has 12 divisors (see below), whose sum is σ = 187935283828320. Its totient is φ = 48326215841496.
The previous prime is 102022011220919. The next prime is 102022011221017. The reversal of 102022011221012 is 210122110220201.
It is a super-2 number, since 2×1020220112210122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022011221017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 671197442168 + ... + 671197442319.
It is an arithmetic number, because the mean of its divisors is an integer number (15661273652360).
Almost surely, 2102022011221012 is an apocalyptic number.
It is an amenable number.
102022011221012 is a deficient number, since it is larger than the sum of its proper divisors (85913272607308).
102022011221012 is a wasteful number, since it uses less digits than its factorization.
102022011221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1342394884510 (or 1342394884508 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102022011221012 its reverse (210122110220201), we get a palindrome (312144121441213).
The spelling of 102022011221012 in words is "one hundred two trillion, twenty-two billion, eleven million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •