Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …100011010111111100011011 |
3 | 111101111202120002002201100110 |
4 | 113031300332203113330123 |
5 | 101340310333034133034 |
6 | 1001052320221535403 |
7 | 30335361154514364 |
oct | 2715607643277433 |
9 | 441452502081313 |
10 | 102101012021019 |
11 | 2a594883577470 |
12 | b54ba3a414563 |
13 | 44c8112a7564b |
14 | 1b2da02cbcb6b |
15 | bc0d3578ede9 |
hex | 5cdc3e8d7f1b |
102101012021019 has 32 divisors (see below), whose sum is σ = 151382656339200. Its totient is φ = 60694147376000.
The previous prime is 102101012021017. The next prime is 102101012021089. The reversal of 102101012021019 is 910120210101201.
It is a cyclic number.
It is not a de Polignac number, because 102101012021019 - 21 = 102101012021017 is a prime.
It is a super-2 number, since 2×1021010120210192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102101012020986 and 102101012021004.
It is not an unprimeable number, because it can be changed into a prime (102101012021017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 142789944 + ... + 143503205.
It is an arithmetic number, because the mean of its divisors is an integer number (4730708010600).
Almost surely, 2102101012021019 is an apocalyptic number.
102101012021019 is a deficient number, since it is larger than the sum of its proper divisors (49281644318181).
102101012021019 is a wasteful number, since it uses less digits than its factorization.
102101012021019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286293371.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 102101012021019 in words is "one hundred two trillion, one hundred one billion, twelve million, twenty-one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •