Base | Representation |
---|---|
bin | 10101011010111101… |
… | …111100011001110001 |
3 | 2012100222111002101222 |
4 | 111122331330121301 |
5 | 334101230232423 |
6 | 14322211434425 |
7 | 1442662323224 |
oct | 253275743161 |
9 | 65328432358 |
10 | 23001024113 |
11 | 9833529941 |
12 | 455abb5a15 |
13 | 222735a352 |
14 | 1182ab75bb |
15 | 8e94633c8 |
hex | 55af7c671 |
23001024113 has 4 divisors (see below), whose sum is σ = 23153348928. Its totient is φ = 22848699300.
The previous prime is 23001024107. The next prime is 23001024131. The reversal of 23001024113 is 31142010032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23001024113 - 212 = 23001020017 is a prime.
It is a super-2 number, since 2×230010241132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23001024091 and 23001024100.
It is not an unprimeable number, because it can be changed into a prime (23001024713) 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, 76162181 + ... + 76162482.
It is an arithmetic number, because the mean of its divisors is an integer number (5788337232).
Almost surely, 223001024113 is an apocalyptic number.
It is an amenable number.
23001024113 is a deficient number, since it is larger than the sum of its proper divisors (152324815).
23001024113 is a wasteful number, since it uses less digits than its factorization.
23001024113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152324814.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 23001024113 its reverse (31142010032), we get a palindrome (54143034145).
The spelling of 23001024113 in words is "twenty-three billion, one million, twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •