Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …0000010010000011100111 |
3 | 1022102011221021102221211001 |
4 | 2101203012100102003213 |
5 | 2302333104031201434 |
6 | 33134505430454131 |
7 | 2051423063300143 |
oct | 221430620220347 |
9 | 38364837387731 |
10 | 10002010022119 |
11 | 32069129a6425 |
12 | 1156558b04347 |
13 | 57725470151b |
14 | 268158076223 |
15 | 125296635114 |
hex | 918c64120e7 |
10002010022119 has 2 divisors, whose sum is σ = 10002010022120. Its totient is φ = 10002010022118.
The previous prime is 10002010022117. The next prime is 10002010022129. The reversal of 10002010022119 is 91122001020001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10002010022119 - 21 = 10002010022117 is a prime.
It is a super-2 number, since 2×100020100221192 (a number of 27 digits) contains 22 as substring.
Together with 10002010022117, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10002010022096 and 10002010022105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002010022117) 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 as a sum of consecutive naturals, namely, 5001005011059 + 5001005011060.
It is an arithmetic number, because the mean of its divisors is an integer number (5001005011060).
Almost surely, 210002010022119 is an apocalyptic number.
10002010022119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002010022119 is an equidigital number, since it uses as much as digits as its factorization.
10002010022119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 10002010022119 in words is "ten trillion, two billion, ten million, twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •