Base | Representation |
---|---|
bin | 10011100110011110… |
… | …00001100110100001 |
3 | 1000011101100122111210 |
4 | 21303033001212201 |
5 | 133022423100103 |
6 | 4500113500333 |
7 | 521530114230 |
oct | 116317014641 |
9 | 30141318453 |
10 | 10523253153 |
11 | 4510113936 |
12 | 20582716a9 |
13 | cb922461a |
14 | 71b84cb17 |
15 | 418cbae03 |
hex | 2733c19a1 |
10523253153 has 8 divisors (see below), whose sum is σ = 16035433408. Its totient is φ = 6013287504.
The previous prime is 10523253127. The next prime is 10523253193. The reversal of 10523253153 is 35135232501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10523253153 - 216 = 10523187617 is a prime.
It is a super-2 number, since 2×105232531532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10523253153.
It is not an unprimeable number, because it can be changed into a prime (10523253193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250553626 + ... + 250553667.
It is an arithmetic number, because the mean of its divisors is an integer number (2004429176).
Almost surely, 210523253153 is an apocalyptic number.
It is an amenable number.
10523253153 is a deficient number, since it is larger than the sum of its proper divisors (5512180255).
10523253153 is an equidigital number, since it uses as much as digits as its factorization.
10523253153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501107303.
The product of its (nonzero) digits is 13500, while the sum is 30.
Adding to 10523253153 its reverse (35135232501), we get a palindrome (45658485654).
The spelling of 10523253153 in words is "ten billion, five hundred twenty-three million, two hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •