Base | Representation |
---|---|
bin | 111111110110100010… |
… | …1000100001000010101 |
3 | 111002221020022122021210 |
4 | 1333231011010020111 |
5 | 4221311101422010 |
6 | 142554233532033 |
7 | 12622666431600 |
oct | 1775505041025 |
9 | 432836278253 |
10 | 137121514005 |
11 | 53175579aa3 |
12 | 226a9874019 |
13 | cc13414848 |
14 | 68cb217337 |
15 | 3878181b20 |
hex | 1fed144215 |
137121514005 has 96 divisors (see below), whose sum is σ = 264661772544. Its totient is φ = 60396585984.
The previous prime is 137121513967. The next prime is 137121514007. The reversal of 137121514005 is 500415121731.
It is not a de Polignac number, because 137121514005 - 26 = 137121513941 is a prime.
It is a super-2 number, since 2×1371215140052 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137121514007) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2776609 + ... + 2825561.
It is an arithmetic number, because the mean of its divisors is an integer number (2756893464).
Almost surely, 2137121514005 is an apocalyptic number.
137121514005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
137121514005 is a deficient number, since it is larger than the sum of its proper divisors (127540258539).
137121514005 is a wasteful number, since it uses less digits than its factorization.
137121514005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49115 (or 49108 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 30.
Adding to 137121514005 its reverse (500415121731), we get a palindrome (637536635736).
The spelling of 137121514005 in words is "one hundred thirty-seven billion, one hundred twenty-one million, five hundred fourteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •