Base | Representation |
---|---|
bin | 10101100100100000… |
… | …110101100110000000 |
3 | 2012210010211011001200 |
4 | 111210200311212000 |
5 | 334413224304313 |
6 | 14350132101200 |
7 | 1446645443625 |
oct | 254440654600 |
9 | 65703734050 |
10 | 23161166208 |
11 | 9905968a84 |
12 | 45a4764800 |
13 | 225159a69b |
14 | 119a08234c |
15 | 908547b73 |
hex | 564835980 |
23161166208 has 96 divisors (see below), whose sum is σ = 67906369440. Its totient is φ = 7574701056.
The previous prime is 23161166113. The next prime is 23161166219. The reversal of 23161166208 is 80266116132.
It is a happy number.
23161166208 is a `hidden beast` number, since 2 + 3 + 16 + 1 + 16 + 620 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×231611662082 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 128616 + ... + 250727.
It is an arithmetic number, because the mean of its divisors is an integer number (707358015).
Almost surely, 223161166208 is an apocalyptic number.
It is an amenable number.
23161166208 is an abundant number, since it is smaller than the sum of its proper divisors (44745203232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23161166208 is a wasteful number, since it uses less digits than its factorization.
23161166208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379416 (or 379401 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The spelling of 23161166208 in words is "twenty-three billion, one hundred sixty-one million, one hundred sixty-six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •