Base | Representation |
---|---|
bin | 1001001100000010000000… |
… | …1011101011010111001111 |
3 | 1022202202210212101202001001 |
4 | 2103000200023223113033 |
5 | 2311004004032343203 |
6 | 33252533421401131 |
7 | 2061603325531345 |
oct | 223004013532717 |
9 | 38682725352031 |
10 | 10102303012303 |
11 | 32453a9758377 |
12 | 1171a88a091a7 |
13 | 583848b26228 |
14 | 26cd4dda3995 |
15 | 127bb644691d |
hex | 930202eb5cf |
10102303012303 has 8 divisors (see below), whose sum is σ = 10165854722688. Its totient is φ = 10038787717464.
The previous prime is 10102303012297. The next prime is 10102303012309. The reversal of 10102303012303 is 30321030320101.
It is an interprime number because it is at equal distance from previous prime (10102303012297) and next prime (10102303012309).
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 10102303012303 - 29 = 10102303011791 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 (10102303012309) 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, 8547201 + ... + 9657082.
It is an arithmetic number, because the mean of its divisors is an integer number (1270731840336).
Almost surely, 210102303012303 is an apocalyptic number.
10102303012303 is a deficient number, since it is larger than the sum of its proper divisors (63551710385).
10102303012303 is a wasteful number, since it uses less digits than its factorization.
10102303012303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18207773.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10102303012303 its reverse (30321030320101), we get a palindrome (40423333332404).
The spelling of 10102303012303 in words is "ten trillion, one hundred two billion, three hundred three million, twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •