Base | Representation |
---|---|
bin | 1000000001001101… |
… | …0001010101101101 |
3 | 12120000101010110112 |
4 | 2000103101111231 |
5 | 13402022113110 |
6 | 553332145405 |
7 | 104225151266 |
oct | 20023212555 |
9 | 5500333415 |
10 | 2152535405 |
11 | a05060789 |
12 | 500a68265 |
13 | 283c532b7 |
14 | 165c4396d |
15 | c8e93405 |
hex | 804d156d |
2152535405 has 4 divisors (see below), whose sum is σ = 2583042492. Its totient is φ = 1722028320.
The previous prime is 2152535381. The next prime is 2152535419. The reversal of 2152535405 is 5045352512.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1078596964 + 1073938441 = 32842^2 + 32771^2 .
It is not a de Polignac number, because 2152535405 - 28 = 2152535149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 215253536 + ... + 215253545.
It is an arithmetic number, because the mean of its divisors is an integer number (645760623).
Almost surely, 22152535405 is an apocalyptic number.
It is an amenable number.
2152535405 is a deficient number, since it is larger than the sum of its proper divisors (430507087).
2152535405 is an equidigital number, since it uses as much as digits as its factorization.
2152535405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430507086.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 2152535405 is about 46395.4243972399. The cubic root of 2152535405 is about 1291.1700229448.
Adding to 2152535405 its reverse (5045352512), we get a palindrome (7197887917).
The spelling of 2152535405 in words is "two billion, one hundred fifty-two million, five hundred thirty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •