Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1000011000101101001 |
3 | 100202100002101122011200 |
4 | 1133000333003011221 |
5 | 3132420113013001 |
6 | 114511313314413 |
7 | 10241125462104 |
oct | 1370077030551 |
9 | 322302348150 |
10 | 102022001001 |
11 | 3a2a383a408 |
12 | 17932b65a09 |
13 | 980b6bac3b |
14 | 4d1b80573b |
15 | 29c19e6086 |
hex | 17c0fc3169 |
102022001001 has 12 divisors (see below), whose sum is σ = 147624109620. Its totient is φ = 67895130240.
The previous prime is 102022000991. The next prime is 102022001033. The reversal of 102022001001 is 100100220201.
It can be written as a sum of positive squares in 2 ways, for example, as 52578031401 + 49443969600 = 229299^2 + 222360^2 .
It is not a de Polignac number, because 102022001001 - 210 = 102021999977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102022001051) 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 11 ways as a sum of consecutive naturals, for example, 9956020 + ... + 9966261.
It is an arithmetic number, because the mean of its divisors is an integer number (12302009135).
Almost surely, 2102022001001 is an apocalyptic number.
It is an amenable number.
102022001001 is a deficient number, since it is larger than the sum of its proper divisors (45602108619).
102022001001 is a wasteful number, since it uses less digits than its factorization.
102022001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19922856 (or 19922853 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102022001001 its reverse (100100220201), we get a palindrome (202122221202).
The spelling of 102022001001 in words is "one hundred two billion, twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •