Base | Representation |
---|---|
bin | 1001001100000001010101… |
… | …1001100110010000010011 |
3 | 1022202202100021000001111112 |
4 | 2103000111121212100103 |
5 | 2311003121230041034 |
6 | 33252503440203535 |
7 | 2061566001103310 |
oct | 223002531462023 |
9 | 38682307001445 |
10 | 10102122112019 |
11 | 3245316630303 |
12 | 1171a383095ab |
13 | 58381a4c8642 |
14 | 26cd33d53d07 |
15 | 127ba56117ce |
hex | 93015666413 |
10102122112019 has 16 divisors (see below), whose sum is σ = 11549028254400. Its totient is φ = 8656152958464.
The previous prime is 10102122111989. The next prime is 10102122112021. The reversal of 10102122112019 is 91021122120101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10102122112019 - 212 = 10102122107923 is a prime.
It is a super-2 number, since 2×101021221120192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10102122111985 and 10102122112003.
It is not an unprimeable number, because it can be changed into a prime (10102122112079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 335726327 + ... + 335756415.
It is an arithmetic number, because the mean of its divisors is an integer number (721814265900).
Almost surely, 210102122112019 is an apocalyptic number.
10102122112019 is a deficient number, since it is larger than the sum of its proper divisors (1446906142381).
10102122112019 is an equidigital number, since it uses as much as digits as its factorization.
10102122112019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44062.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 10102122112019 in words is "ten trillion, one hundred two billion, one hundred twenty-two million, one hundred twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •