Base | Representation |
---|---|
bin | 10101101001111111… |
… | …010110001010101111 |
3 | 2020000112201022222020 |
4 | 111221333112022233 |
5 | 340110240100111 |
6 | 14403213321223 |
7 | 1452142443531 |
oct | 255177261257 |
9 | 66015638866 |
10 | 23253050031 |
11 | 9952816722 |
12 | 460b496213 |
13 | 226762bc03 |
14 | 11a835d851 |
15 | 911647906 |
hex | 569fd62af |
23253050031 has 4 divisors (see below), whose sum is σ = 31004066712. Its totient is φ = 15502033352.
The previous prime is 23253050021. The next prime is 23253050047. The reversal of 23253050031 is 13005035232.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23253050031 - 219 = 23252525743 is a prime.
It is a super-5 number, since 5×232530500315 (a number of 53 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 23253049983 and 23253050010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23253050011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3875508336 + ... + 3875508341.
It is an arithmetic number, because the mean of its divisors is an integer number (7751016678).
Almost surely, 223253050031 is an apocalyptic number.
23253050031 is a deficient number, since it is larger than the sum of its proper divisors (7751016681).
23253050031 is an equidigital number, since it uses as much as digits as its factorization.
23253050031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7751016680.
The product of its (nonzero) digits is 2700, while the sum is 24.
Adding to 23253050031 its reverse (13005035232), we get a palindrome (36258085263).
The spelling of 23253050031 in words is "twenty-three billion, two hundred fifty-three million, fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •