Base | Representation |
---|---|
bin | 111111011111000… |
… | …0100101101011001 |
3 | 12111110100110000101 |
4 | 1332332010231121 |
5 | 13330312421213 |
6 | 551213335401 |
7 | 103534261543 |
oct | 17676045531 |
9 | 5443313011 |
10 | 2130201433 |
11 | 9a3496958 |
12 | 4b5497561 |
13 | 27c433729 |
14 | 162cac693 |
15 | c7030bdd |
hex | 7ef84b59 |
2130201433 has 2 divisors, whose sum is σ = 2130201434. Its totient is φ = 2130201432.
The previous prime is 2130201413. The next prime is 2130201449. The reversal of 2130201433 is 3341020312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1792082889 + 338118544 = 42333^2 + 18388^2 .
It is a cyclic number.
It is not a de Polignac number, because 2130201433 - 29 = 2130200921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2130201433.
It is not a weakly prime, because it can be changed into another prime (2130201413) 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, 1065100716 + 1065100717.
It is an arithmetic number, because the mean of its divisors is an integer number (1065100717).
Almost surely, 22130201433 is an apocalyptic number.
It is an amenable number.
2130201433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130201433 is an equidigital number, since it uses as much as digits as its factorization.
2130201433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2130201433 is about 46154.1052670291. The cubic root of 2130201433 is about 1286.6889091686.
Adding to 2130201433 its reverse (3341020312), we get a palindrome (5471221745).
The spelling of 2130201433 in words is "two billion, one hundred thirty million, two hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •