Base | Representation |
---|---|
bin | 10101111111101001… |
… | …110011100101110101 |
3 | 2020221212121121112012 |
4 | 111333221303211311 |
5 | 341331311032013 |
6 | 14503235334005 |
7 | 1464144645620 |
oct | 257751634565 |
9 | 66855547465 |
10 | 23616502133 |
11 | a019999664 |
12 | 46b1151305 |
13 | 22c4a15023 |
14 | 120072cdb7 |
15 | 9334dc1a8 |
hex | 57fa73975 |
23616502133 has 4 divisors (see below), whose sum is σ = 26990288160. Its totient is φ = 20242716108.
The previous prime is 23616502121. The next prime is 23616502139. The reversal of 23616502133 is 33120561632.
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 a de Polignac number, because none of the positive numbers 2k-23616502133 is a prime.
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 23616502133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23616502139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1686893003 + ... + 1686893016.
It is an arithmetic number, because the mean of its divisors is an integer number (6747572040).
Almost surely, 223616502133 is an apocalyptic number.
It is an amenable number.
23616502133 is a deficient number, since it is larger than the sum of its proper divisors (3373786027).
23616502133 is an equidigital number, since it uses as much as digits as its factorization.
23616502133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3373786026.
The product of its (nonzero) digits is 19440, while the sum is 32.
The spelling of 23616502133 in words is "twenty-three billion, six hundred sixteen million, five hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •