Base | Representation |
---|---|
bin | 10110100100111011… |
… | …11110111101011011 |
3 | 1011021201211002212201 |
4 | 23102131332331123 |
5 | 144310434310021 |
6 | 5322431151031 |
7 | 606240612415 |
oct | 132235767533 |
9 | 34251732781 |
10 | 12121010011 |
11 | 515aaa3250 |
12 | 2423375477 |
13 | 11b2253396 |
14 | 82db1b9b5 |
15 | 4ae1c5591 |
hex | 2d277ef5b |
12121010011 has 4 divisors (see below), whose sum is σ = 13222920024. Its totient is φ = 11019100000.
The previous prime is 12121010003. The next prime is 12121010039. The reversal of 12121010011 is 11001012121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12121010011 - 23 = 12121010003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12121010011.
It is not an unprimeable number, because it can be changed into a prime (12121010071) 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, 550954990 + ... + 550955011.
It is an arithmetic number, because the mean of its divisors is an integer number (3305730006).
Almost surely, 212121010011 is an apocalyptic number.
12121010011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12121010011 is a deficient number, since it is larger than the sum of its proper divisors (1101910013).
12121010011 is a wasteful number, since it uses less digits than its factorization.
12121010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101910012.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12121010011 its reverse (11001012121), we get a palindrome (23122022132).
The spelling of 12121010011 in words is "twelve billion, one hundred twenty-one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •