Base | Representation |
---|---|
bin | 1010110000101000011011… |
… | …11001111101010001111000 |
3 | 10002202222201021111001002001 |
4 | 11120110031321331101320 |
5 | 11100131123240140210 |
6 | 122153450422350344 |
7 | 4661315536452421 |
oct | 530241571752170 |
9 | 102688637431061 |
10 | 23661208130680 |
11 | 75a273116387a |
12 | 27a184a88b3b4 |
13 | 102831c5ab533 |
14 | 5bb2cc4d6648 |
15 | 2b0737c9003a |
hex | 15850de7d478 |
23661208130680 has 128 divisors (see below), whose sum is σ = 58497807240000. Its totient is φ = 8581001379840.
The previous prime is 23661208130633. The next prime is 23661208130683. The reversal of 23661208130680 is 8603180216632.
It is a self number, because there is not a number n which added to its sum of digits gives 23661208130680.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23661208130683) 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 31 ways as a sum of consecutive naturals, for example, 5181705 + ... + 8612344.
Almost surely, 223661208130680 is an apocalyptic number.
23661208130680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23661208130680 is an abundant number, since it is smaller than the sum of its proper divisors (34836599109320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23661208130680 is a wasteful number, since it uses less digits than its factorization.
23661208130680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13794177 (or 13794173 counting only the distinct ones).
The product of its (nonzero) digits is 497664, while the sum is 46.
The spelling of 23661208130680 in words is "twenty-three trillion, six hundred sixty-one billion, two hundred eight million, one hundred thirty thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •