Base | Representation |
---|---|
bin | 1001010010000110011110… |
… | …11101100110111110101100 |
3 | 2200021110221120202011111002 |
4 | 10221003033131212332230 |
5 | 10133422130300024030 |
6 | 111225402331015432 |
7 | 4204542156415355 |
oct | 451031735467654 |
9 | 80243846664432 |
10 | 20413165236140 |
11 | 65601a1673186 |
12 | 235825b89a578 |
13 | b50c512c8921 |
14 | 508006abcd2c |
15 | 255ed7470245 |
hex | 1290cf766fac |
20413165236140 has 96 divisors (see below), whose sum is σ = 44153690112000. Its totient is φ = 7923892983552.
The previous prime is 20413165236097. The next prime is 20413165236179. The reversal of 20413165236140 is 4163256131402.
It is a super-3 number, since 3×204131652361403 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20413165236094 and 20413165236103.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 662126246 + ... + 662157074.
It is an arithmetic number, because the mean of its divisors is an integer number (459934272000).
Almost surely, 220413165236140 is an apocalyptic number.
20413165236140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20413165236140 is an abundant number, since it is smaller than the sum of its proper divisors (23740524875860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20413165236140 is a wasteful number, since it uses less digits than its factorization.
20413165236140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38079 (or 38077 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 20413165236140 in words is "twenty trillion, four hundred thirteen billion, one hundred sixty-five million, two hundred thirty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •