Base | Representation |
---|---|
bin | 10110011011010001… |
… | …11111100101111111 |
3 | 1011002002101212220102 |
4 | 23031220333211333 |
5 | 144124220310421 |
6 | 5310415111315 |
7 | 604235253203 |
oct | 131550774577 |
9 | 34062355812 |
10 | 12040010111 |
11 | 51192a9888 |
12 | 240021253b |
13 | 119b532b4c |
14 | 823074b03 |
15 | 4a702560b |
hex | 2cda3f97f |
12040010111 has 4 divisors (see below), whose sum is σ = 12043962000. Its totient is φ = 12036058224.
The previous prime is 12040010093. The next prime is 12040010131. The reversal of 12040010111 is 11101004021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11101004021 = 1993 ⋅5569997.
It is a cyclic number.
It is not a de Polignac number, because 12040010111 - 214 = 12039993727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12040010092 and 12040010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12040010131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1971371 + ... + 1977468.
It is an arithmetic number, because the mean of its divisors is an integer number (3010990500).
Almost surely, 212040010111 is an apocalyptic number.
12040010111 is a deficient number, since it is larger than the sum of its proper divisors (3951889).
12040010111 is an equidigital number, since it uses as much as digits as its factorization.
12040010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3951888.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 12040010111 its reverse (11101004021), we get a palindrome (23141014132).
The spelling of 12040010111 in words is "twelve billion, forty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •