Base | Representation |
---|---|
bin | 10111001100100111011001… |
… | …101010101010100001111100 |
3 | 111101020012122021220100100020 |
4 | 113030213121222222201330 |
5 | 101333012034031201022 |
6 | 1000552133034532140 |
7 | 30326563341556563 |
oct | 2714473152524174 |
9 | 441205567810306 |
10 | 102022010022012 |
11 | 2a564322a492a3 |
12 | b538670897050 |
13 | 44c083262ab82 |
14 | 1b29c6a8d0bda |
15 | bbdc5ec0a35c |
hex | 5cc9d9aaa87c |
102022010022012 has 24 divisors (see below), whose sum is σ = 240505494418896. Its totient is φ = 33656745573888.
The previous prime is 102022010021977. The next prime is 102022010022059. The reversal of 102022010022012 is 210220010220201.
It is a junction number, because it is equal to n+sod(n) for n = 102022010021982 and 102022010022000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43823886303 + ... + 43823888630.
It is an arithmetic number, because the mean of its divisors is an integer number (10021062267454).
Almost surely, 2102022010022012 is an apocalyptic number.
102022010022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102022010022012 is an abundant number, since it is smaller than the sum of its proper divisors (138483484396884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022010022012 is a wasteful number, since it uses less digits than its factorization.
102022010022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87647775037 (or 87647775035 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102022010022012 its reverse (210220010220201), we get a palindrome (312242020242213).
The spelling of 102022010022012 in words is "one hundred two trillion, twenty-two billion, ten million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •