Base | Representation |
---|---|
bin | 1001001010000001100001… |
… | …10010010011100010101100 |
3 | 2122021221120100011100211002 |
4 | 10211000300302103202230 |
5 | 10114400230021133020 |
6 | 110454102320215432 |
7 | 4145515364013635 |
oct | 445006062234254 |
9 | 78257510140732 |
10 | 20135625177260 |
11 | 646351a52909a |
12 | 231250416a578 |
13 | b30a206b9808 |
14 | 4d87d884688c |
15 | 24db91993975 |
hex | 125030c938ac |
20135625177260 has 12 divisors (see below), whose sum is σ = 42284812872288. Its totient is φ = 8054250070896.
The previous prime is 20135625177251. The next prime is 20135625177377. The reversal of 20135625177260 is 6277152653102.
It is a super-2 number, since 2×201356251772602 (a number of 27 digits) contains 22 as substring.
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, 503390629412 + ... + 503390629451.
It is an arithmetic number, because the mean of its divisors is an integer number (3523734406024).
Almost surely, 220135625177260 is an apocalyptic number.
20135625177260 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20135625177260 is an abundant number, since it is smaller than the sum of its proper divisors (22149187695028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20135625177260 is a wasteful number, since it uses less digits than its factorization.
20135625177260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006781258872 (or 1006781258870 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 20135625177260 in words is "twenty trillion, one hundred thirty-five billion, six hundred twenty-five million, one hundred seventy-seven thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •