Base | Representation |
---|---|
bin | 1001000110110010101110… |
… | …1101111010011111010001 |
3 | 1022110011111120000221121212 |
4 | 2101230223231322133101 |
5 | 2303020143332121223 |
6 | 33143331012225505 |
7 | 2052236116460465 |
oct | 221545355723721 |
9 | 38404446027555 |
10 | 10012302223313 |
11 | 3210214648525 |
12 | 115854b90b295 |
13 | 578204ab8ac0 |
14 | 268852d3c4a5 |
15 | 125699eb1278 |
hex | 91b2bb7a7d1 |
10012302223313 has 8 divisors (see below), whose sum is σ = 11011893771648. Its totient is φ = 9045484168464.
The previous prime is 10012302223303. The next prime is 10012302223331. The reversal of 10012302223313 is 31332220321001.
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 10012302223313 - 218 = 10012301961169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012302223303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8193372731 + ... + 8193373952.
It is an arithmetic number, because the mean of its divisors is an integer number (1376486721456).
Almost surely, 210012302223313 is an apocalyptic number.
10012302223313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10012302223313 is a deficient number, since it is larger than the sum of its proper divisors (999591548335).
10012302223313 is a wasteful number, since it uses less digits than its factorization.
10012302223313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16386746743.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10012302223313 its reverse (31332220321001), we get a palindrome (41344522544314).
The spelling of 10012302223313 in words is "ten trillion, twelve billion, three hundred two million, two hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •