Base | Representation |
---|---|
bin | 1010101100000111110010… |
… | …11001110110010010011100 |
3 | 10002020011201122122222002112 |
4 | 11112003321121312102130 |
5 | 11040111242302041320 |
6 | 121554341532213152 |
7 | 4644161446514462 |
oct | 526037131662234 |
9 | 102204648588075 |
10 | 23506245346460 |
11 | 7542a40767468 |
12 | 277780200a1b8 |
13 | 1016824b00986 |
14 | 5b39cb9b0832 |
15 | 2ab6b865aec5 |
hex | 1560f967649c |
23506245346460 has 48 divisors (see below), whose sum is σ = 49592170943616. Its totient is φ = 9358941759552.
The previous prime is 23506245346459. The next prime is 23506245346487. The reversal of 23506245346460 is 6464354260532.
It is a junction number, because it is equal to n+sod(n) for n = 23506245346399 and 23506245346408.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 2844179 + ... + 7423061.
It is an arithmetic number, because the mean of its divisors is an integer number (1033170227992).
Almost surely, 223506245346460 is an apocalyptic number.
23506245346460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23506245346460 is an abundant number, since it is smaller than the sum of its proper divisors (26085925597156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23506245346460 is a wasteful number, since it uses less digits than its factorization.
23506245346460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4580082 (or 4580080 counting only the distinct ones).
The product of its (nonzero) digits is 12441600, while the sum is 50.
The spelling of 23506245346460 in words is "twenty-three trillion, five hundred six billion, two hundred forty-five million, three hundred forty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •