Base | Representation |
---|---|
bin | 1000000001011001… |
… | …0100100101100111 |
3 | 12120001212202111110 |
4 | 2000112110211213 |
5 | 13402223211033 |
6 | 553401240103 |
7 | 104235022011 |
oct | 20026244547 |
9 | 5501782443 |
10 | 2153335143 |
11 | a05557623 |
12 | 501193033 |
13 | 28417330b |
14 | 165db11b1 |
15 | c90a0363 |
hex | 80594967 |
2153335143 has 8 divisors (see below), whose sum is σ = 2872032768. Its totient is φ = 1435097144.
The previous prime is 2153335111. The next prime is 2153335181. The reversal of 2153335143 is 3415333512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2153335143 - 25 = 2153335111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2153335143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2153335103) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 103821 + ... + 122822.
It is an arithmetic number, because the mean of its divisors is an integer number (359004096).
Almost surely, 22153335143 is an apocalyptic number.
2153335143 is a deficient number, since it is larger than the sum of its proper divisors (718697625).
2153335143 is a wasteful number, since it uses less digits than its factorization.
2153335143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229813.
The product of its digits is 16200, while the sum is 30.
The square root of 2153335143 is about 46404.0423131434. The cubic root of 2153335143 is about 1291.3299072491.
Adding to 2153335143 its reverse (3415333512), we get a palindrome (5568668655).
The spelling of 2153335143 in words is "two billion, one hundred fifty-three million, three hundred thirty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •