Base | Representation |
---|---|
bin | 111011111110000… |
… | …1000010100101001 |
3 | 12012020101222000212 |
4 | 1313330020110221 |
5 | 13110114021213 |
6 | 531401310505 |
7 | 100602566153 |
oct | 16774102451 |
9 | 5166358025 |
10 | 2012251433 |
11 | 942955315 |
12 | 481a95435 |
13 | 260b7692a |
14 | 151367ad3 |
15 | bb9d29a8 |
hex | 77f08529 |
2012251433 has 2 divisors, whose sum is σ = 2012251434. Its totient is φ = 2012251432.
The previous prime is 2012251429. The next prime is 2012251453. The reversal of 2012251433 is 3341522102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1498231849 + 514019584 = 38707^2 + 22672^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012251433 - 22 = 2012251429 is a prime.
It is a super-2 number, since 2×20122514332 = 8098311659221106978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2012251399 and 2012251408.
It is not a weakly prime, because it can be changed into another prime (2012251453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006125716 + 1006125717.
It is an arithmetic number, because the mean of its divisors is an integer number (1006125717).
Almost surely, 22012251433 is an apocalyptic number.
It is an amenable number.
2012251433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012251433 is an equidigital number, since it uses as much as digits as its factorization.
2012251433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 2012251433 is about 44858.1256072966. The cubic root of 2012251433 is about 1262.4884543335.
Adding to 2012251433 its reverse (3341522102), we get a palindrome (5353773535).
The spelling of 2012251433 in words is "two billion, twelve million, two hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •