Base | Representation |
---|---|
bin | 1001000110001101100001… |
… | …0000001111001011001011 |
3 | 1022102012201022200000212112 |
4 | 2101203120100033023023 |
5 | 2302334213333001303 |
6 | 33134555415132535 |
7 | 2051433421125545 |
oct | 221433020171313 |
9 | 38365638600775 |
10 | 10002312000203 |
11 | 3206a58400a96 |
12 | 115662207414b |
13 | 5772a2142793 |
14 | 268186202695 |
15 | 1252b2dd50d8 |
hex | 918d840f2cb |
10002312000203 has 8 divisors (see below), whose sum is σ = 10479071216640. Its totient is φ = 9535184283240.
The previous prime is 10002312000199. The next prime is 10002312000211. The reversal of 10002312000203 is 30200021320001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10002312000203 - 22 = 10002312000199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002312000293) 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 in 7 ways as a sum of consecutive naturals, for example, 2407872743 + ... + 2407876896.
It is an arithmetic number, because the mean of its divisors is an integer number (1309883902080).
Almost surely, 210002312000203 is an apocalyptic number.
10002312000203 is a deficient number, since it is larger than the sum of its proper divisors (476759216437).
10002312000203 is an equidigital number, since it uses as much as digits as its factorization.
10002312000203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4815749737.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 10002312000203 its reverse (30200021320001), we get a palindrome (40202333320204).
The spelling of 10002312000203 in words is "ten trillion, two billion, three hundred twelve million, two hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •