Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0100100001001111101011 |
3 | 1022102002120220220021021202 |
4 | 2101202100010201033223 |
5 | 2302324223322001224 |
6 | 33134235314354415 |
7 | 2051361414414263 |
oct | 221422004411753 |
9 | 38362526807252 |
10 | 10001100968939 |
11 | 3206496850303 |
12 | 115634458ba0b |
13 | 57713b288232 |
14 | 2680ad4407a3 |
15 | 12524191aeae |
hex | 918901213eb |
10001100968939 has 2 divisors, whose sum is σ = 10001100968940. Its totient is φ = 10001100968938.
The previous prime is 10001100968923. The next prime is 10001100968941. The reversal of 10001100968939 is 93986900110001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10001100968939 - 24 = 10001100968923 is a prime.
Together with 10001100968941, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001100968893 and 10001100968902.
It is not a weakly prime, because it can be changed into another prime (10001100968039) 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, 5000550484469 + 5000550484470.
It is an arithmetic number, because the mean of its divisors is an integer number (5000550484470).
Almost surely, 210001100968939 is an apocalyptic number.
10001100968939 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001100968939 is an equidigital number, since it uses as much as digits as its factorization.
10001100968939 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 47.
The spelling of 10001100968939 in words is "ten trillion, one billion, one hundred million, nine hundred sixty-eight thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •