Base | Representation |
---|---|
bin | 1010110000011110111010… |
… | …10100111000001001001011 |
3 | 10002202111112011010110001221 |
4 | 11120033131110320021023 |
5 | 11100040142110333101 |
6 | 122151243401422511 |
7 | 4661045110306561 |
oct | 530173524701113 |
9 | 102674464113057 |
10 | 23656098136651 |
11 | 75a0549759712 |
12 | 27a086349aa37 |
13 | 10279b6a1a226 |
14 | 5bad659a1a31 |
15 | 2b053935caa1 |
hex | 1583dd53824b |
23656098136651 has 4 divisors (see below), whose sum is σ = 23688999525600. Its totient is φ = 23623196747704.
The previous prime is 23656098136613. The next prime is 23656098136663. The reversal of 23656098136651 is 15663189065632.
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 23656098136651 - 27 = 23656098136523 is a prime.
It is a super-2 number, since 2×236560981366512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23656098136651.
It is not an unprimeable number, because it can be changed into a prime (23656098136691) 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, 16450693396 + ... + 16450694833.
It is an arithmetic number, because the mean of its divisors is an integer number (5922249881400).
Almost surely, 223656098136651 is an apocalyptic number.
23656098136651 is a deficient number, since it is larger than the sum of its proper divisors (32901388949).
23656098136651 is an equidigital number, since it uses as much as digits as its factorization.
23656098136651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32901388948.
The product of its (nonzero) digits is 41990400, while the sum is 61.
The spelling of 23656098136651 in words is "twenty-three trillion, six hundred fifty-six billion, ninety-eight million, one hundred thirty-six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •