Base | Representation |
---|---|
bin | 10110010111111101… |
… | …11010000001010111 |
3 | 1011000011001222122011 |
4 | 23023332322001113 |
5 | 144100110400043 |
6 | 5303543045051 |
7 | 603450005215 |
oct | 131376720127 |
9 | 34004058564 |
10 | 12012200023 |
11 | 510463473a |
12 | 23b2a40787 |
13 | 1195846885 |
14 | 81d4b5cb5 |
15 | 4a488059d |
hex | 2cbfba057 |
12012200023 has 4 divisors (see below), whose sum is σ = 12021520320. Its totient is φ = 12002879728.
The previous prime is 12012199933. The next prime is 12012200029. The reversal of 12012200023 is 32000221021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32000221021 = 19 ⋅1684222159.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12012200023 is a prime.
It is a super-2 number, since 2×120122000232 (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 = 12012199976 and 12012200012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012200029) 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, 4658215 + ... + 4660792.
It is an arithmetic number, because the mean of its divisors is an integer number (3005380080).
Almost surely, 212012200023 is an apocalyptic number.
12012200023 is a deficient number, since it is larger than the sum of its proper divisors (9320297).
12012200023 is an equidigital number, since it uses as much as digits as its factorization.
12012200023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9320296.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 12012200023 its reverse (32000221021), we get a palindrome (44012421044).
The spelling of 12012200023 in words is "twelve billion, twelve million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •