Base | Representation |
---|---|
bin | 110000000001001110… |
… | …0110110000111001000 |
3 | 100212011122002120222020 |
4 | 1200002130312013020 |
5 | 3142142301044313 |
6 | 115212310324440 |
7 | 10310263232016 |
oct | 1400234660710 |
9 | 325148076866 |
10 | 103120331208 |
11 | 3a807814124 |
12 | 17b9a959720 |
13 | 995510587b |
14 | 4dc362b8b6 |
15 | 2a3814c323 |
hex | 18027361c8 |
103120331208 has 16 divisors (see below), whose sum is σ = 257800828080. Its totient is φ = 34373443728.
The previous prime is 103120331183. The next prime is 103120331233. The reversal of 103120331208 is 802133021301.
It is an interprime number because it is at equal distance from previous prime (103120331183) and next prime (103120331233).
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 4296680467 = 103120331208 / (1 + 0 + 3 + 1 + 2 + 0 + 3 + 3 + 1 + 2 + 0 + 8).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2148340210 + ... + 2148340257.
It is an arithmetic number, because the mean of its divisors is an integer number (16112551755).
Almost surely, 2103120331208 is an apocalyptic number.
It is an amenable number.
103120331208 is an abundant number, since it is smaller than the sum of its proper divisors (154680496872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103120331208 is a wasteful number, since it uses less digits than its factorization.
103120331208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4296680476 (or 4296680472 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 103120331208 its reverse (802133021301), we get a palindrome (905253352509).
The spelling of 103120331208 in words is "one hundred three billion, one hundred twenty million, three hundred thirty-one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •