Base | Representation |
---|---|
bin | 1001001010000001100111… |
… | …11000110000110000110100 |
3 | 2122021221200222001110121022 |
4 | 10211000303320300300310 |
5 | 10114400331330421320 |
6 | 110454111415240312 |
7 | 4145516565141662 |
oct | 445006370606064 |
9 | 78257628043538 |
10 | 20135677201460 |
11 | 64635469316a7 |
12 | 2312519679098 |
13 | b30a2b403372 |
14 | 4d8801709c32 |
15 | 24db9631d325 |
hex | 125033e30c34 |
20135677201460 has 24 divisors (see below), whose sum is σ = 42285751262496. Its totient is φ = 8054112949280.
The previous prime is 20135677201459. The next prime is 20135677201463. The reversal of 20135677201460 is 6410277653102.
It is a happy number.
It is a super-2 number, since 2×201356772014602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20135677201463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8822522 + ... + 10867761.
It is an arithmetic number, because the mean of its divisors is an integer number (1761906302604).
Almost surely, 220135677201460 is an apocalyptic number.
20135677201460 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20135677201460 is an abundant number, since it is smaller than the sum of its proper divisors (22150074061036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20135677201460 is a wasteful number, since it uses less digits than its factorization.
20135677201460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19741423 (or 19741421 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 44.
The spelling of 20135677201460 in words is "twenty trillion, one hundred thirty-five billion, six hundred seventy-seven million, two hundred one thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •