Base | Representation |
---|---|
bin | 1010110001000100110000… |
… | …10010000110001110001100 |
3 | 10002211102222001011120000002 |
4 | 11120202120102012032030 |
5 | 11100403244120211320 |
6 | 122204443354223432 |
7 | 4662364424451254 |
oct | 530423022061614 |
9 | 102742861146002 |
10 | 23676414616460 |
11 | 75a91248986a1 |
12 | 27a4793424b78 |
13 | 10298a3b42a08 |
14 | 5bbd31d0a964 |
15 | 2b0d27c90675 |
hex | 15889848638c |
23676414616460 has 12 divisors (see below), whose sum is σ = 49720470694608. Its totient is φ = 9470565846576.
The previous prime is 23676414616457. The next prime is 23676414616489. The reversal of 23676414616460 is 6461641467632.
It is a junction number, because it is equal to n+sod(n) for n = 23676414616396 and 23676414616405.
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 3 ways as a sum of consecutive naturals, for example, 591910365392 + ... + 591910365431.
It is an arithmetic number, because the mean of its divisors is an integer number (4143372557884).
Almost surely, 223676414616460 is an apocalyptic number.
23676414616460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23676414616460 is an abundant number, since it is smaller than the sum of its proper divisors (26044056078148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23676414616460 is a wasteful number, since it uses less digits than its factorization.
23676414616460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183820730832 (or 1183820730830 counting only the distinct ones).
The product of its (nonzero) digits is 20901888, while the sum is 56.
The spelling of 23676414616460 in words is "twenty-three trillion, six hundred seventy-six billion, four hundred fourteen million, six hundred sixteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •