Base | Representation |
---|---|
bin | 1011000000010100011000… |
… | …1010011011000000011011 |
3 | 1120211202110202220110222122 |
4 | 2300011012022123000123 |
5 | 3041222001100310021 |
6 | 41422413104411455 |
7 | 2356126521034256 |
oct | 260050612330033 |
9 | 46752422813878 |
10 | 12100100010011 |
11 | 3945695008a02 |
12 | 14350b7016b8b |
13 | 69a05ab47540 |
14 | 2db91003409d |
15 | 15eb40d12bab |
hex | b014629b01b |
12100100010011 has 16 divisors (see below), whose sum is σ = 13084336274688. Its totient is φ = 11123511300000.
The previous prime is 12100100009947. The next prime is 12100100010017. The reversal of 12100100010011 is 11001000100121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12100100010011 - 26 = 12100100009947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100100010017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28000736 + ... + 28429586.
It is an arithmetic number, because the mean of its divisors is an integer number (817771017168).
Almost surely, 212100100010011 is an apocalyptic number.
12100100010011 is a deficient number, since it is larger than the sum of its proper divisors (984236264677).
12100100010011 is a wasteful number, since it uses less digits than its factorization.
12100100010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437762.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 12100100010011 its reverse (11001000100121), we get a palindrome (23101100110132).
It can be divided in two parts, 1 and 2100100010011, that added together give a palindrome (2100100010012).
The spelling of 12100100010011 in words is "twelve trillion, one hundred billion, one hundred million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •