Base | Representation |
---|---|
bin | 10110100010011101… |
… | …11111100010110111 |
3 | 1011020021212002020112 |
4 | 23101032333202313 |
5 | 144240134144111 |
6 | 5320411253235 |
7 | 605566610255 |
oct | 132116774267 |
9 | 34207762215 |
10 | 12100303031 |
11 | 514a33a843 |
12 | 241844a21b |
13 | 11aab8322b |
14 | 82b08b5d5 |
15 | 4ac484e8b |
hex | 2d13bf8b7 |
12100303031 has 4 divisors (see below), whose sum is σ = 12100743864. Its totient is φ = 12099862200.
The previous prime is 12100303021. The next prime is 12100303049. The reversal of 12100303031 is 13030300121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13030300121 = 11821 ⋅1102301.
It is a cyclic number.
It is not a de Polignac number, because 12100303031 - 222 = 12096108727 is a prime.
It is a super-2 number, since 2×121003030312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12100302997 and 12100303015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100303001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 176300 + ... + 235121.
It is an arithmetic number, because the mean of its divisors is an integer number (3025185966).
Almost surely, 212100303031 is an apocalyptic number.
12100303031 is a deficient number, since it is larger than the sum of its proper divisors (440833).
12100303031 is an equidigital number, since it uses as much as digits as its factorization.
12100303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440832.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 12100303031 its reverse (13030300121), we get a palindrome (25130603152).
The spelling of 12100303031 in words is "twelve billion, one hundred million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •