Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1001010011011011110 |
3 | 100202022022201210110210 |
4 | 1133000111022123132 |
5 | 3132404310133042 |
6 | 114510242113250 |
7 | 10240633241361 |
oct | 1370025123336 |
9 | 322268653423 |
10 | 102011021022 |
11 | 3a29861aa49 |
12 | 1792b34b826 |
13 | 9809345301 |
14 | 4d1a1880d8 |
15 | 29c0a77a9c |
hex | 17c054a6de |
102011021022 has 16 divisors (see below), whose sum is σ = 205628516352. Its totient is φ = 33735927960.
The previous prime is 102011021017. The next prime is 102011021023. The reversal of 102011021022 is 220120110201.
It is a junction number, because it is equal to n+sod(n) for n = 102011020989 and 102011021007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011021023) 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 7 ways as a sum of consecutive naturals, for example, 66935604 + ... + 66937127.
It is an arithmetic number, because the mean of its divisors is an integer number (12851782272).
Almost surely, 2102011021022 is an apocalyptic number.
102011021022 is an abundant number, since it is smaller than the sum of its proper divisors (103617495330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011021022 is a wasteful number, since it uses less digits than its factorization.
102011021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133872863.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102011021022 its reverse (220120110201), we get a palindrome (322131131223).
The spelling of 102011021022 in words is "one hundred two billion, eleven million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •