Base | Representation |
---|---|
bin | 11101010001110101001… |
… | …110100101100001000001 |
3 | 21010100100112111212011111 |
4 | 131101311032211201001 |
5 | 230431044412434411 |
6 | 4140145540043321 |
7 | 265235343110662 |
oct | 35216516454101 |
9 | 7110315455144 |
10 | 2012011452481 |
11 | 706320014918 |
12 | 285b36693541 |
13 | 117968ba88c4 |
14 | 6d54bc0d369 |
15 | 3750c761721 |
hex | 1d4753a5841 |
2012011452481 has 2 divisors, whose sum is σ = 2012011452482. Its totient is φ = 2012011452480.
The previous prime is 2012011452449. The next prime is 2012011452491. The reversal of 2012011452481 is 1842541102102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1908498042256 + 103513410225 = 1381484^2 + 321735^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012011452481 - 25 = 2012011452449 is a prime.
It is a super-2 number, since 2×20120114524812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2012011452491) 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, 1006005726240 + 1006005726241.
It is an arithmetic number, because the mean of its divisors is an integer number (1006005726241).
Almost surely, 22012011452481 is an apocalyptic number.
It is an amenable number.
2012011452481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012011452481 is an equidigital number, since it uses as much as digits as its factorization.
2012011452481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120, while the sum is 31.
Adding to 2012011452481 its reverse (1842541102102), we get a palindrome (3854552554583).
The spelling of 2012011452481 in words is "two trillion, twelve billion, eleven million, four hundred fifty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •