Base | Representation |
---|---|
bin | 1010111010100011010000… |
… | …0000101001101011000101 |
3 | 1120111021201002211221102211 |
4 | 2232220310000221223011 |
5 | 3033111032332222244 |
6 | 41305104411503421 |
7 | 2346021150115255 |
oct | 256506400515305 |
9 | 46437632757384 |
10 | 12001011210949 |
11 | 3907666a65632 |
12 | 1419a62457b71 |
13 | 6908c9053867 |
14 | 2d6bd0007965 |
15 | 15c291ab8934 |
hex | aea34029ac5 |
12001011210949 has 2 divisors, whose sum is σ = 12001011210950. Its totient is φ = 12001011210948.
The previous prime is 12001011210907. The next prime is 12001011211001. The reversal of 12001011210949 is 94901211010021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8452335144100 + 3548676066849 = 2907290^2 + 1883793^2 .
It is a cyclic number.
It is not a de Polignac number, because 12001011210949 - 219 = 12001010686661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12001011210949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001011214949) 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 as a sum of consecutive naturals, namely, 6000505605474 + 6000505605475.
It is an arithmetic number, because the mean of its divisors is an integer number (6000505605475).
Almost surely, 212001011210949 is an apocalyptic number.
It is an amenable number.
12001011210949 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001011210949 is an equidigital number, since it uses as much as digits as its factorization.
12001011210949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 12001011210949 in words is "twelve trillion, one billion, eleven million, two hundred ten thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •