Base | Representation |
---|---|
bin | 1001001010000100100000… |
… | …11100110011100110001000 |
3 | 2122022002201012012122011111 |
4 | 10211002100130303212020 |
5 | 10114412021404412440 |
6 | 110454525452340104 |
7 | 4145603223052522 |
oct | 445022034634610 |
9 | 78262635178144 |
10 | 20137230154120 |
11 | 6464173499a52 |
12 | 2312891774634 |
13 | b30c18075971 |
14 | 4d890ba74a12 |
15 | 24dc378274ea |
hex | 125090733988 |
20137230154120 has 16 divisors (see below), whose sum is σ = 45308767846860. Its totient is φ = 8054892061632.
The previous prime is 20137230154091. The next prime is 20137230154123. The reversal of 20137230154120 is 2145103273102.
It can be written as a sum of positive squares in 2 ways, for example, as 18350137094436 + 1787093059684 = 4283706^2 + 1336822^2 .
It is not an unprimeable number, because it can be changed into a prime (20137230154123) by changing a digit.
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, 251715376887 + ... + 251715376966.
Almost surely, 220137230154120 is an apocalyptic number.
20137230154120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20137230154120 is an abundant number, since it is smaller than the sum of its proper divisors (25171537692740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20137230154120 is a wasteful number, since it uses less digits than its factorization.
20137230154120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503430753864 (or 503430753860 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The spelling of 20137230154120 in words is "twenty trillion, one hundred thirty-seven billion, two hundred thirty million, one hundred fifty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •