Base | Representation |
---|---|
bin | 10111001101110001000011… |
… | …110110110011100100111110 |
3 | 111101111202210021112100222010 |
4 | 113031301003312303210332 |
5 | 101340311023324013042 |
6 | 1001052333121032050 |
7 | 30335363315031324 |
oct | 2715610366634476 |
9 | 441452707470863 |
10 | 102101101001022 |
11 | 2a594919821462 |
12 | b54ba64185626 |
13 | 44c812832b236 |
14 | 1b2da10a41d14 |
15 | bc0d3d4b959c |
hex | 5cdc43db393e |
102101101001022 has 64 divisors (see below), whose sum is σ = 207604973942784. Its totient is φ = 33468359416800.
The previous prime is 102101101000981. The next prime is 102101101001051. The reversal of 102101101001022 is 220100101101201.
It is a junction number, because it is equal to n+sod(n) for n = 102101101000989 and 102101101001007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 573296833 + ... + 573474899.
It is an arithmetic number, because the mean of its divisors is an integer number (3243827717856).
Almost surely, 2102101101001022 is an apocalyptic number.
102101101001022 is an abundant number, since it is smaller than the sum of its proper divisors (105503872941762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101101001022 is a wasteful number, since it uses less digits than its factorization.
102101101001022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180573.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102101101001022 its reverse (220100101101201), we get a palindrome (322201202102223).
The spelling of 102101101001022 in words is "one hundred two trillion, one hundred one billion, one hundred one million, one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •