Base | Representation |
---|---|
bin | 1001010001111010000000… |
… | …0001010101010101111011 |
3 | 1100010102022210011011220020 |
4 | 2110132200001111111323 |
5 | 2314132204400011443 |
6 | 33411144452501523 |
7 | 2102105413202424 |
oct | 224364001252573 |
9 | 40112283134806 |
10 | 10203232032123 |
11 | 3284191536849 |
12 | 118955591a8a3 |
13 | 590211c50130 |
14 | 273ba657664b |
15 | 12a621ee1583 |
hex | 947a005557b |
10203232032123 has 48 divisors (see below), whose sum is σ = 15469926587136. Its totient is φ = 5945575608000.
The previous prime is 10203232032121. The next prime is 10203232032157. The reversal of 10203232032123 is 32123023230201.
It is not a de Polignac number, because 10203232032123 - 21 = 10203232032121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10203232032093 and 10203232032102.
It is not an unprimeable number, because it can be changed into a prime (10203232032121) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29209248 + ... + 29556498.
It is an arithmetic number, because the mean of its divisors is an integer number (322290137232).
Almost surely, 210203232032123 is an apocalyptic number.
10203232032123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10203232032123 is a deficient number, since it is larger than the sum of its proper divisors (5266694555013).
10203232032123 is a wasteful number, since it uses less digits than its factorization.
10203232032123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349392 (or 349373 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 10203232032123 its reverse (32123023230201), we get a palindrome (42326255262324).
The spelling of 10203232032123 in words is "ten trillion, two hundred three billion, two hundred thirty-two million, thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •