Base | Representation |
---|---|
bin | 1011111001011010110000… |
… | …11110000110110111111100 |
3 | 10102122002000211100212011120 |
4 | 11330231120132012313330 |
5 | 11412120020300244140 |
6 | 131350414443350540 |
7 | 5340102654364515 |
oct | 574553036066774 |
9 | 112562024325146 |
10 | 26162130087420 |
11 | 837732a430878 |
12 | 2b26490522450 |
13 | 117a102ca3cb2 |
14 | 66637a7dda0c |
15 | 30580c7b81d0 |
hex | 17cb58786dfc |
26162130087420 has 48 divisors (see below), whose sum is σ = 74957544816000. Its totient is φ = 6814322254656.
The previous prime is 26162130087391. The next prime is 26162130087427. The reversal of 26162130087420 is 2478003126162.
It is a super-2 number, since 2×261621300874202 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26162130087427) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5070177670 + ... + 5070182829.
It is an arithmetic number, because the mean of its divisors is an integer number (1561615517000).
Almost surely, 226162130087420 is an apocalyptic number.
26162130087420 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
26162130087420 is an abundant number, since it is smaller than the sum of its proper divisors (48795414728580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26162130087420 is a wasteful number, since it uses less digits than its factorization.
26162130087420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10140360554 (or 10140360552 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 42.
The spelling of 26162130087420 in words is "twenty-six trillion, one hundred sixty-two billion, one hundred thirty million, eighty-seven thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •