Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …101001110100000010010011 |
3 | 111010110111222210022002200012 |
4 | 112300303220221310002103 |
5 | 101110204312224312243 |
6 | 552530205311345135 |
7 | 30041531634152162 |
oct | 2660635051640223 |
9 | 433414883262605 |
10 | 100111001010323 |
11 | 29997923200146 |
12 | b28a2238221ab |
13 | 43b2571b44b44 |
14 | 1aa1580d273d9 |
15 | b891b46e7d18 |
hex | 5b0ce8a74093 |
100111001010323 has 2 divisors, whose sum is σ = 100111001010324. Its totient is φ = 100111001010322.
The previous prime is 100111001010301. The next prime is 100111001010347. The reversal of 100111001010323 is 323010100111001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (323010100111001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100111001010323 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 100111001010298 and 100111001010307.
It is not a weakly prime, because it can be changed into another prime (100111001210323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055500505161 + 50055500505162.
It is an arithmetic number, because the mean of its divisors is an integer number (50055500505162).
Almost surely, 2100111001010323 is an apocalyptic number.
100111001010323 is a deficient number, since it is larger than the sum of its proper divisors (1).
100111001010323 is an equidigital number, since it uses as much as digits as its factorization.
100111001010323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 100111001010323 its reverse (323010100111001), we get a palindrome (423121101121324).
The spelling of 100111001010323 in words is "one hundred trillion, one hundred eleven billion, one million, ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •