Base | Representation |
---|---|
bin | 10110000000000000… |
… | …011010000111101101 |
3 | 2020222021202122002001 |
4 | 112000000122013231 |
5 | 341334320131432 |
6 | 14504010332301 |
7 | 1464246213622 |
oct | 260000320755 |
9 | 66867678061 |
10 | 23622427117 |
11 | a022276143 |
12 | 46b312a091 |
13 | 22c600ab33 |
14 | 1201432349 |
15 | 933cac9e7 |
hex | 58001a1ed |
23622427117 has 4 divisors (see below), whose sum is σ = 23856312636. Its totient is φ = 23388541600.
The previous prime is 23622427099. The next prime is 23622427133. The reversal of 23622427117 is 71172422632.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22318567236 + 1303859881 = 149394^2 + 36109^2 .
It is a cyclic number.
It is not a de Polignac number, because 23622427117 - 215 = 23622394349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23622427417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116942608 + ... + 116942809.
It is an arithmetic number, because the mean of its divisors is an integer number (5964078159).
Almost surely, 223622427117 is an apocalyptic number.
It is an amenable number.
23622427117 is a deficient number, since it is larger than the sum of its proper divisors (233885519).
23622427117 is a wasteful number, since it uses less digits than its factorization.
23622427117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233885518.
The product of its digits is 56448, while the sum is 37.
Adding to 23622427117 its reverse (71172422632), we get a palindrome (94794849749).
The spelling of 23622427117 in words is "twenty-three billion, six hundred twenty-two million, four hundred twenty-seven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •