Base | Representation |
---|---|
bin | 1001001001111001000110… |
… | …11110101010100100001100 |
3 | 2122021111220110100000121110 |
4 | 10210330203132222210030 |
5 | 10114312001340120310 |
6 | 110452034115132020 |
7 | 4145265411540543 |
oct | 444744336524414 |
9 | 78244813300543 |
10 | 20131106957580 |
11 | 6461611073843 |
12 | 2311662ba4010 |
13 | b30480604048 |
14 | 4d84ca75715a |
15 | 24d9c9ea6d20 |
hex | 124f237aa90c |
20131106957580 has 48 divisors (see below), whose sum is σ = 57139251541344. Its totient is φ = 5294756897280.
The previous prime is 20131106957567. The next prime is 20131106957629. The reversal of 20131106957580 is 8575960113102.
It is a super-2 number, since 2×201311069575802 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2298067191 + ... + 2298075950.
It is an arithmetic number, because the mean of its divisors is an integer number (1190401073778).
Almost surely, 220131106957580 is an apocalyptic number.
20131106957580 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20131106957580 is an abundant number, since it is smaller than the sum of its proper divisors (37008144583764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20131106957580 is a wasteful number, since it uses less digits than its factorization.
20131106957580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4596143226 (or 4596143224 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 48.
The spelling of 20131106957580 in words is "twenty trillion, one hundred thirty-one billion, one hundred six million, nine hundred fifty-seven thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •