Base | Representation |
---|---|
bin | 1010100100011000100010… |
… | …01100110111100100001011 |
3 | 10001021202102102010102011011 |
4 | 11102030101030313210023 |
5 | 11021232222243442101 |
6 | 121232250014144351 |
7 | 4616026462621555 |
oct | 522142114674413 |
9 | 101252372112134 |
10 | 23240356624651 |
11 | 74501a8492371 |
12 | 27341784b20b7 |
13 | cc773004a95a |
14 | 5a4ba6d164d5 |
15 | 2a48059cc751 |
hex | 15231133790b |
23240356624651 has 4 divisors (see below), whose sum is σ = 23261162674672. Its totient is φ = 23219550574632.
The previous prime is 23240356624613. The next prime is 23240356624691. The reversal of 23240356624651 is 15642665304232.
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 23240356624651 - 211 = 23240356622603 is a prime.
It is a super-2 number, since 2×232403566246512 (a number of 28 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 = 23240356624595 and 23240356624604.
It is not an unprimeable number, because it can be changed into a prime (23240356624691) 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, 10403023335 + ... + 10403025568.
It is an arithmetic number, because the mean of its divisors is an integer number (5815290668668).
Almost surely, 223240356624651 is an apocalyptic number.
23240356624651 is a deficient number, since it is larger than the sum of its proper divisors (20806050021).
23240356624651 is a wasteful number, since it uses less digits than its factorization.
23240356624651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20806050020.
The product of its (nonzero) digits is 6220800, while the sum is 49.
The spelling of 23240356624651 in words is "twenty-three trillion, two hundred forty billion, three hundred fifty-six million, six hundred twenty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •