Base | Representation |
---|---|
bin | 1001000110110010101110… |
… | …1101111010011111001101 |
3 | 1022110011111120000221121201 |
4 | 2101230223231322133031 |
5 | 2303020143332121214 |
6 | 33143331012225501 |
7 | 2052236116460461 |
oct | 221545355723715 |
9 | 38404446027551 |
10 | 10012302223309 |
11 | 3210214648521 |
12 | 115854b90b291 |
13 | 578204ab8ab9 |
14 | 268852d3c4a1 |
15 | 125699eb1274 |
hex | 91b2bb7a7cd |
10012302223309 has 4 divisors (see below), whose sum is σ = 10539265498240. Its totient is φ = 9485338948380.
The previous prime is 10012302223303. The next prime is 10012302223331. The reversal of 10012302223309 is 90332220321001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10012302223309 - 25 = 10012302223277 is a prime.
It is a Duffinian number.
It is a congruent 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 3 ways as a sum of consecutive naturals, for example, 263481637437 + ... + 263481637474.
It is an arithmetic number, because the mean of its divisors is an integer number (2634816374560).
Almost surely, 210012302223309 is an apocalyptic number.
10012302223309 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10012302223309 is a deficient number, since it is larger than the sum of its proper divisors (526963274931).
10012302223309 is an equidigital number, since it uses as much as digits as its factorization.
10012302223309 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526963274930.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 10012302223309 in words is "ten trillion, twelve billion, three hundred two million, two hundred twenty-three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •