Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …1000010010001111100011 |
3 | 1022102000001000011112120012 |
4 | 2101201111020102033203 |
5 | 2302320212144202243 |
6 | 33133553231435135 |
7 | 2051325046234352 |
oct | 221412510221743 |
9 | 38360030145505 |
10 | 10000112100323 |
11 | 320602963a714 |
12 | 1156109385aab |
13 | 577011447887 |
14 | 268017d8d999 |
15 | 1251d4bd7d18 |
hex | 918552123e3 |
10000112100323 has 4 divisors (see below), whose sum is σ = 10000120407528. Its totient is φ = 10000103793120.
The previous prime is 10000112100313. The next prime is 10000112100359. The reversal of 10000112100323 is 32300121100001.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10000112100323 - 238 = 9725234193379 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10000112100298 and 10000112100307.
It is not an unprimeable number, because it can be changed into a prime (10000112100313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1962713 + ... + 4883898.
It is an arithmetic number, because the mean of its divisors is an integer number (2500030101882).
Almost surely, 210000112100323 is an apocalyptic number.
10000112100323 is a deficient number, since it is larger than the sum of its proper divisors (8307205).
10000112100323 is an equidigital number, since it uses as much as digits as its factorization.
10000112100323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8307204.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10000112100323 its reverse (32300121100001), we get a palindrome (42300233200324).
The spelling of 10000112100323 in words is "ten trillion, one hundred twelve million, one hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •