Base | Representation |
---|---|
bin | 10110100010110011… |
… | …01010011001100101 |
3 | 1011020111010011222011 |
4 | 23101121222121211 |
5 | 144241343200010 |
6 | 5320551234221 |
7 | 605632436563 |
oct | 132131523145 |
9 | 34214104864 |
10 | 12103100005 |
11 | 5150980197 |
12 | 2419378971 |
13 | 11ab622349 |
14 | 82b5b8a33 |
15 | 4ac838a8a |
hex | 2d166a665 |
12103100005 has 8 divisors (see below), whose sum is σ = 14542809624. Its totient is φ = 9669753600.
The previous prime is 12103099999. The next prime is 12103100017. The reversal of 12103100005 is 50000130121.
12103100005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1893816324 + 10209283681 = 43518^2 + 101041^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12103100005 - 215 = 12103067237 is a prime.
It is a Duffinian number.
It is a congruent number.
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, 1586616 + ... + 1594225.
It is an arithmetic number, because the mean of its divisors is an integer number (1817851203).
Almost surely, 212103100005 is an apocalyptic number.
It is an amenable number.
12103100005 is a deficient number, since it is larger than the sum of its proper divisors (2439709619).
12103100005 is an equidigital number, since it uses as much as digits as its factorization.
12103100005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3181607.
The product of its (nonzero) digits is 30, while the sum is 13.
Adding to 12103100005 its reverse (50000130121), we get a palindrome (62103230126).
The spelling of 12103100005 in words is "twelve billion, one hundred three million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •