Base | Representation |
---|---|
bin | 10110100010011011… |
… | …11011001011100011 |
3 | 1011020021022212010102 |
4 | 23101031323023203 |
5 | 144240101214021 |
6 | 5320401253015 |
7 | 605564333006 |
oct | 132115731343 |
9 | 34207285112 |
10 | 12100023011 |
11 | 514a16941a |
12 | 241833416b |
13 | 11aaab593b |
14 | 82b01753d |
15 | 4ac42c00b |
hex | 2d137b2e3 |
12100023011 has 8 divisors (see below), whose sum is σ = 12629582880. Its totient is φ = 11570752512.
The previous prime is 12100022999. The next prime is 12100023029. The reversal of 12100023011 is 11032000121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12100023011 - 218 = 12099760867 is a prime.
It is a super-2 number, since 2×121000230112 (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 = 12100022983 and 12100023001.
It is not an unprimeable number, because it can be changed into a prime (12100083011) 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 7 ways as a sum of consecutive naturals, for example, 15395 + ... + 156323.
It is an arithmetic number, because the mean of its divisors is an integer number (1578697860).
Almost surely, 212100023011 is an apocalyptic number.
12100023011 is a deficient number, since it is larger than the sum of its proper divisors (529559869).
12100023011 is a wasteful number, since it uses less digits than its factorization.
12100023011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144685.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 12100023011 its reverse (11032000121), we get a palindrome (23132023132).
The spelling of 12100023011 in words is "twelve billion, one hundred million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •