Base | Representation |
---|---|
bin | 10111011011010100001001… |
… | …101101001011001111101110 |
3 | 111111210202221112001122020121 |
4 | 113123110021231023033232 |
5 | 102001034302111114410 |
6 | 1003044150354235154 |
7 | 30462553212020320 |
oct | 2733241155131756 |
9 | 444722845048217 |
10 | 103032133301230 |
11 | 2a91375622a751 |
12 | b680398b85aba |
13 | 4564b71cb8553 |
14 | 1b62ad35cb610 |
15 | bda1800819da |
hex | 5db509b4b3ee |
103032133301230 has 64 divisors (see below), whose sum is σ = 212040426240000. Its totient is φ = 35310537972864.
The previous prime is 103032133301197. The next prime is 103032133301243. The reversal of 103032133301230 is 32103331230301.
It is a junction number, because it is equal to n+sod(n) for n = 103032133301195 and 103032133301204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1740172287 + ... + 1740231493.
It is an arithmetic number, because the mean of its divisors is an integer number (3313131660000).
Almost surely, 2103032133301230 is an apocalyptic number.
103032133301230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103032133301230 is an abundant number, since it is smaller than the sum of its proper divisors (109008292938770).
103032133301230 is a wasteful number, since it uses less digits than its factorization.
103032133301230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69193.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 103032133301230 its reverse (32103331230301), we get a palindrome (135135464531531).
The spelling of 103032133301230 in words is "one hundred three trillion, thirty-two billion, one hundred thirty-three million, three hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •