Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1011101111100111001 |
3 | 100202100002121020002221 |
4 | 1133000333131330321 |
5 | 3132420130023113 |
6 | 114511315524041 |
7 | 10241126430643 |
oct | 1370077357471 |
9 | 322302536087 |
10 | 102022111033 |
11 | 3a2a3905047 |
12 | 17932bb9621 |
13 | 980b72904b |
14 | 4d1b833893 |
15 | 29c1a1898d |
hex | 17c0fddf39 |
102022111033 has 8 divisors (see below), whose sum is σ = 109390798080. Its totient is φ = 94805355840.
The previous prime is 102022111031. The next prime is 102022111039. The reversal of 102022111033 is 330111220201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102022111033 - 21 = 102022111031 is a prime.
It is a super-2 number, since 2×1020221110332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102022110998 and 102022111016.
It is not an unprimeable number, because it can be changed into a prime (102022111031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37981573 + ... + 37984258.
It is an arithmetic number, because the mean of its divisors is an integer number (13673849760).
Almost surely, 2102022111033 is an apocalyptic number.
It is an amenable number.
102022111033 is a deficient number, since it is larger than the sum of its proper divisors (7368687047).
102022111033 is an equidigital number, since it uses as much as digits as its factorization.
102022111033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75965927.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102022111033 its reverse (330111220201), we get a palindrome (432133331234).
The spelling of 102022111033 in words is "one hundred two billion, twenty-two million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •