Base | Representation |
---|---|
bin | 10101011100011101… |
… | …011010010011000111 |
3 | 2012102201120112210211 |
4 | 111130131122103013 |
5 | 334124132101442 |
6 | 14324504100251 |
7 | 1443415124554 |
oct | 253435322307 |
9 | 65381515724 |
10 | 23026050247 |
11 | 98466723a2 |
12 | 4567464687 |
13 | 222c5b0405 |
14 | 118614da2b |
15 | 8eb758617 |
hex | 55c75a4c7 |
23026050247 has 8 divisors (see below), whose sum is σ = 23125241216. Its totient is φ = 22927016952.
The previous prime is 23026050241. The next prime is 23026050253. The reversal of 23026050247 is 74205062032.
It is an interprime number because it is at equal distance from previous prime (23026050241) and next prime (23026050253).
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 23026050247 - 27 = 23026050119 is a prime.
It is a super-2 number, since 2×230260502472 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23026050241) 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 7 ways as a sum of consecutive naturals, for example, 258088 + ... + 335650.
It is an arithmetic number, because the mean of its divisors is an integer number (2890655152).
Almost surely, 223026050247 is an apocalyptic number.
23026050247 is a deficient number, since it is larger than the sum of its proper divisors (99190969).
23026050247 is an equidigital number, since it uses as much as digits as its factorization.
23026050247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78837.
The product of its (nonzero) digits is 20160, while the sum is 31.
The spelling of 23026050247 in words is "twenty-three billion, twenty-six million, fifty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •