Base | Representation |
---|---|
bin | 10110000000010000… |
… | …011111101101110110 |
3 | 2020222120200220000120 |
4 | 112000100133231312 |
5 | 341341410104332 |
6 | 14504240552410 |
7 | 1464330110010 |
oct | 260020375566 |
9 | 66876626016 |
10 | 23626644342 |
11 | a024696654 |
12 | 46b4622706 |
13 | 22c6b56532 |
14 | 1201c0d1b0 |
15 | 93434232c |
hex | 58041fb76 |
23626644342 has 16 divisors (see below), whose sum is σ = 54003758592. Its totient is φ = 6750469800.
The previous prime is 23626644337. The next prime is 23626644373. The reversal of 23626644342 is 24344662632.
It is a super-2 number, since 2×236266443422 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 562539151 = 23626644342 / (2 + 3 + 6 + 2 + 6 + 6 + 4 + 4 + 3 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 23626644294 and 23626644303.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281269534 + ... + 281269617.
It is an arithmetic number, because the mean of its divisors is an integer number (3375234912).
Almost surely, 223626644342 is an apocalyptic number.
23626644342 is an abundant number, since it is smaller than the sum of its proper divisors (30377114250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23626644342 is a wasteful number, since it uses less digits than its factorization.
23626644342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562539163.
The product of its digits is 995328, while the sum is 42.
The spelling of 23626644342 in words is "twenty-three billion, six hundred twenty-six million, six hundred forty-four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •