Base | Representation |
---|---|
bin | 110000000001100111… |
… | …0000011100000011010 |
3 | 100212012112100222100010 |
4 | 1200003032003200122 |
5 | 3142204101344010 |
6 | 115213451022350 |
7 | 10310511000066 |
oct | 1400316034032 |
9 | 325175328303 |
10 | 103133231130 |
11 | 3a814025016 |
12 | 17ba313a9b6 |
13 | 99579a1367 |
14 | 4dc5228aa6 |
15 | 2a39349620 |
hex | 180338381a |
103133231130 has 16 divisors (see below), whose sum is σ = 247519754784. Its totient is φ = 27502194960.
The previous prime is 103133231081. The next prime is 103133231137. The reversal of 103133231130 is 31132331301.
It is a junction number, because it is equal to n+sod(n) for n = 103133231097 and 103133231106.
It is not an unprimeable number, because it can be changed into a prime (103133231137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1718887156 + ... + 1718887215.
It is an arithmetic number, because the mean of its divisors is an integer number (15469984674).
Almost surely, 2103133231130 is an apocalyptic number.
103133231130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103133231130 is an abundant number, since it is smaller than the sum of its proper divisors (144386523654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103133231130 is a wasteful number, since it uses less digits than its factorization.
103133231130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437774381.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103133231130 its reverse (31132331301), we get a palindrome (134265562431).
The spelling of 103133231130 in words is "one hundred three billion, one hundred thirty-three million, two hundred thirty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •