Base | Representation |
---|---|
bin | 110000000110111010… |
… | …1011000010111001010 |
3 | 100212122221110102211010 |
4 | 1200031311120113022 |
5 | 3143040143443310 |
6 | 115243251544350 |
7 | 10315102444212 |
oct | 1401565302712 |
9 | 325587412733 |
10 | 103311312330 |
11 | 3a8a55a7066 |
12 | 180328bb0b6 |
13 | 9985852a55 |
14 | 5000b43242 |
15 | 2a49cc4320 |
hex | 180dd585ca |
103311312330 has 16 divisors (see below), whose sum is σ = 247947149664. Its totient is φ = 27549683280.
The previous prime is 103311312263. The next prime is 103311312341. The reversal of 103311312330 is 33213113301.
It is a super-5 number, since 5×1033113123305 (a number of 56 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103311312297 and 103311312306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1721855176 + ... + 1721855235.
It is an arithmetic number, because the mean of its divisors is an integer number (15496696854).
Almost surely, 2103311312330 is an apocalyptic number.
103311312330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103311312330 is an abundant number, since it is smaller than the sum of its proper divisors (144635837334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103311312330 is a wasteful number, since it uses less digits than its factorization.
103311312330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3443710421.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103311312330 its reverse (33213113301), we get a palindrome (136524425631).
The spelling of 103311312330 in words is "one hundred three billion, three hundred eleven million, three hundred twelve thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •