Base | Representation |
---|---|
bin | 10101111000111001… |
… | …110010111010100001 |
3 | 2020122222111222010112 |
4 | 111320321302322201 |
5 | 341113313100103 |
6 | 14444112141105 |
7 | 1461301232642 |
oct | 257071627241 |
9 | 66588458115 |
10 | 23503253153 |
11 | 9a70a78a66 |
12 | 467b237795 |
13 | 22a7412bb3 |
14 | 11cd68d6c9 |
15 | 9285bbcd8 |
hex | 578e72ea1 |
23503253153 has 4 divisors (see below), whose sum is σ = 23562455700. Its totient is φ = 23444050608.
The previous prime is 23503253129. The next prime is 23503253159. The reversal of 23503253153 is 35135230532.
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 20899906624 + 2603346529 = 144568^2 + 51023^2 .
It is a cyclic number.
It is not a de Polignac number, because 23503253153 - 28 = 23503252897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23503253159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29600678 + ... + 29601471.
It is an arithmetic number, because the mean of its divisors is an integer number (5890613925).
Almost surely, 223503253153 is an apocalyptic number.
It is an amenable number.
23503253153 is a deficient number, since it is larger than the sum of its proper divisors (59202547).
23503253153 is an equidigital number, since it uses as much as digits as its factorization.
23503253153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59202546.
The product of its (nonzero) digits is 40500, while the sum is 32.
Adding to 23503253153 its reverse (35135230532), we get a palindrome (58638483685).
The spelling of 23503253153 in words is "twenty-three billion, five hundred three million, two hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •