Base | Representation |
---|---|
bin | 1000000001001000… |
… | …0000110001111101 |
3 | 12112222202100211111 |
4 | 2000102000301331 |
5 | 13401431033222 |
6 | 553321122021 |
7 | 104222305264 |
oct | 20022006175 |
9 | 5488670744 |
10 | 2152205437 |
11 | a04955888 |
12 | 500929311 |
13 | 283b69055 |
14 | 165b995db |
15 | c8e2a777 |
hex | 80480c7d |
2152205437 has 2 divisors, whose sum is σ = 2152205438. Its totient is φ = 2152205436.
The previous prime is 2152205413. The next prime is 2152205479. The reversal of 2152205437 is 7345022512.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1510799161 + 641406276 = 38869^2 + 25326^2 .
It is a cyclic number.
It is not a de Polignac number, because 2152205437 - 219 = 2151681149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2152205399 and 2152205408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2152205537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1076102718 + 1076102719.
It is an arithmetic number, because the mean of its divisors is an integer number (1076102719).
Almost surely, 22152205437 is an apocalyptic number.
It is an amenable number.
2152205437 is a deficient number, since it is larger than the sum of its proper divisors (1).
2152205437 is an equidigital number, since it uses as much as digits as its factorization.
2152205437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 2152205437 is about 46391.8682206268. The cubic root of 2152205437 is about 1291.1040439198.
Adding to 2152205437 its reverse (7345022512), we get a palindrome (9497227949).
The spelling of 2152205437 in words is "two billion, one hundred fifty-two million, two hundred five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •