Base | Representation |
---|---|
bin | 10110100010110100… |
… | …11011101111101000 |
3 | 1011020111111110012220 |
4 | 23101122123233220 |
5 | 144241421131440 |
6 | 5320555434040 |
7 | 605634241050 |
oct | 132132335750 |
9 | 34214443186 |
10 | 12103302120 |
11 | 5150aa9028 |
12 | 2419455920 |
13 | 11ab693340 |
14 | 82b62c560 |
15 | 4ac8788d0 |
hex | 2d169bbe8 |
12103302120 has 128 divisors (see below), whose sum is σ = 44689155840. Its totient is φ = 2553661440.
The previous prime is 12103302109. The next prime is 12103302137. The reversal of 12103302120 is 2120330121.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12103302120.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 543261 + ... + 565100.
It is an arithmetic number, because the mean of its divisors is an integer number (349134030).
Almost surely, 212103302120 is an apocalyptic number.
12103302120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12103302120 is an abundant number, since it is smaller than the sum of its proper divisors (32585853720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12103302120 is a wasteful number, since it uses less digits than its factorization.
12103302120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108395 (or 1108391 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 12103302120 its reverse (2120330121), we get a palindrome (14223632241).
The spelling of 12103302120 in words is "twelve billion, one hundred three million, three hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •