Base | Representation |
---|---|
bin | 10110111011101101… |
… | …11100000010001011 |
3 | 1011210001101112102212 |
4 | 23131312330002023 |
5 | 200203344213003 |
6 | 5353415015335 |
7 | 614051063126 |
oct | 133566740213 |
9 | 34701345385 |
10 | 12312101003 |
11 | 5248950794 |
12 | 247736a54b |
13 | 1212a0b587 |
14 | 84b2613bd |
15 | 4c0d6edd8 |
hex | 2dddbc08b |
12312101003 has 4 divisors (see below), whose sum is σ = 12736656240. Its totient is φ = 11887545768.
The previous prime is 12312100991. The next prime is 12312101017. The reversal of 12312101003 is 30010121321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30010121321 = 14029 ⋅2139149.
It is a cyclic number.
It is not a de Polignac number, because 12312101003 - 210 = 12312099979 is a prime.
It is a super-2 number, since 2×123121010032 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12312101083) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 212277575 + ... + 212277632.
It is an arithmetic number, because the mean of its divisors is an integer number (3184164060).
Almost surely, 212312101003 is an apocalyptic number.
12312101003 is a deficient number, since it is larger than the sum of its proper divisors (424555237).
12312101003 is an equidigital number, since it uses as much as digits as its factorization.
12312101003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424555236.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12312101003 its reverse (30010121321), we get a palindrome (42322222324).
The spelling of 12312101003 in words is "twelve billion, three hundred twelve million, one hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •