Base | Representation |
---|---|
bin | 1000000001010110… |
… | …0011110000010001 |
3 | 12120001111121010020 |
4 | 2000111203300101 |
5 | 13402200310441 |
6 | 553353054053 |
7 | 104233226604 |
oct | 20025436021 |
9 | 5501447106 |
10 | 2153135121 |
11 | a05430315 |
12 | 5010b7329 |
13 | 284103267 |
14 | 165d5c33b |
15 | c9060e66 |
hex | 80563c11 |
2153135121 has 8 divisors (see below), whose sum is σ = 2905435680. Its totient is φ = 1418128992.
The previous prime is 2153135113. The next prime is 2153135143. The reversal of 2153135121 is 1215313512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2153135121 - 23 = 2153135113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2153135091 and 2153135100.
It is not an unprimeable number, because it can be changed into a prime (2153135821) 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 in 7 ways as a sum of consecutive naturals, for example, 4323316 + ... + 4323813.
It is an arithmetic number, because the mean of its divisors is an integer number (363179460).
Almost surely, 22153135121 is an apocalyptic number.
It is an amenable number.
2153135121 is a deficient number, since it is larger than the sum of its proper divisors (752300559).
2153135121 is an equidigital number, since it uses as much as digits as its factorization.
2153135121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8647215.
The product of its digits is 900, while the sum is 24.
The square root of 2153135121 is about 46401.8870413693. The cubic root of 2153135121 is about 1291.2899223928.
Adding to 2153135121 its reverse (1215313512), we get a palindrome (3368448633).
The spelling of 2153135121 in words is "two billion, one hundred fifty-three million, one hundred thirty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •