Base | Representation |
---|---|
bin | 10010110110100001… |
… | …11011101101001011 |
3 | 222010100122011020112 |
4 | 21123100323231023 |
5 | 131212000200412 |
6 | 4352150144535 |
7 | 505544634326 |
oct | 113320735513 |
9 | 28110564215 |
10 | 10121100107 |
11 | 4324108348 |
12 | 1b6565214b |
13 | c53b0b041 |
14 | 6c02877bd |
15 | 3e382e722 |
hex | 25b43bb4b |
10121100107 has 2 divisors, whose sum is σ = 10121100108. Its totient is φ = 10121100106.
The previous prime is 10121100083. The next prime is 10121100149. The reversal of 10121100107 is 70100112101.
10121100107 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10121100107 - 26 = 10121100043 is a prime.
It is a super-2 number, since 2×101211001072 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121100091 and 10121100100.
It is not a weakly prime, because it can be changed into another prime (10121160107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060550053 + 5060550054.
It is an arithmetic number, because the mean of its divisors is an integer number (5060550054).
Almost surely, 210121100107 is an apocalyptic number.
10121100107 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121100107 is an equidigital number, since it uses as much as digits as its factorization.
10121100107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 10121100107 its reverse (70100112101), we get a palindrome (80221212208).
The spelling of 10121100107 in words is "ten billion, one hundred twenty-one million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •