Base | Representation |
---|---|
bin | 10111011111011000111010… |
… | …010110001011110011011110 |
3 | 111112210112122102122000122121 |
4 | 113133120322112023303132 |
5 | 102020131211242411110 |
6 | 1003420533404533154 |
7 | 30522024461454235 |
oct | 2737307226136336 |
9 | 445715572560577 |
10 | 103312122232030 |
11 | 2aa11474727528 |
12 | b7066b88511ba |
13 | 45853a30650ba |
14 | 1b72494ba5b1c |
15 | be25baa39cda |
hex | 5df63a58bcde |
103312122232030 has 16 divisors (see below), whose sum is σ = 187102690082064. Its totient is φ = 41071322211840.
The previous prime is 103312122232013. The next prime is 103312122232043. The reversal of 103312122232030 is 30232221213301.
It is a junction number, because it is equal to n+sod(n) for n = 103312122231986 and 103312122232004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31690833411 + ... + 31690836670.
It is an arithmetic number, because the mean of its divisors is an integer number (11693918130129).
Almost surely, 2103312122232030 is an apocalyptic number.
103312122232030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103312122232030 is a deficient number, since it is larger than the sum of its proper divisors (83790567850034).
103312122232030 is a wasteful number, since it uses less digits than its factorization.
103312122232030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63381670251.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 103312122232030 its reverse (30232221213301), we get a palindrome (133544343445331).
The spelling of 103312122232030 in words is "one hundred three trillion, three hundred twelve billion, one hundred twenty-two million, two hundred thirty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •