Base | Representation |
---|---|
bin | 1001010001111010010101… |
… | …0110010111010010100011 |
3 | 1100010102120000101010101021 |
4 | 2110132211112113102203 |
5 | 2314132400241244303 |
6 | 33411201404550311 |
7 | 2102110550113225 |
oct | 224364526272243 |
9 | 40112500333337 |
10 | 10203321431203 |
11 | 3284227a4768a |
12 | 118957b852397 |
13 | 5902276216b4 |
14 | 273bb43a8415 |
15 | 12a629c9eebd |
hex | 947a55974a3 |
10203321431203 has 8 divisors (see below), whose sum is σ = 10270356606000. Its totient is φ = 10136312153760.
The previous prime is 10203321431201. The next prime is 10203321431213. The reversal of 10203321431203 is 30213412330201.
10203321431203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10203321431203 - 21 = 10203321431201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10203321431201) 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, 5683453 + ... + 7260046.
It is an arithmetic number, because the mean of its divisors is an integer number (1283794575750).
Almost surely, 210203321431203 is an apocalyptic number.
10203321431203 is a deficient number, since it is larger than the sum of its proper divisors (67035174797).
10203321431203 is a wasteful number, since it uses less digits than its factorization.
10203321431203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12948677.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 10203321431203 its reverse (30213412330201), we get a palindrome (40416733761404).
The spelling of 10203321431203 in words is "ten trillion, two hundred three billion, three hundred twenty-one million, four hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •