Base | Representation |
---|---|
bin | 1000000001010101001… |
… | …0110101001100110101 |
3 | 111011200020212211021020 |
4 | 2000111102311030311 |
5 | 4224201312232014 |
6 | 143145215011353 |
7 | 12645501320655 |
oct | 2002522651465 |
9 | 434606784236 |
10 | 137796211509 |
11 | 53491407240 |
12 | 22857809b59 |
13 | ccc0135138 |
14 | 6952a86365 |
15 | 38b75071a9 |
hex | 20154b5335 |
137796211509 has 8 divisors (see below), whose sum is σ = 200430853152. Its totient is φ = 83512855440.
The previous prime is 137796211499. The next prime is 137796211519. The reversal of 137796211509 is 905112697731.
It is an interprime number because it is at equal distance from previous prime (137796211499) and next prime (137796211519).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 137796211509 - 24 = 137796211493 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137796211519) 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, 2087821354 + ... + 2087821419.
It is an arithmetic number, because the mean of its divisors is an integer number (25053856644).
Almost surely, 2137796211509 is an apocalyptic number.
It is an amenable number.
137796211509 is a deficient number, since it is larger than the sum of its proper divisors (62634641643).
137796211509 is a wasteful number, since it uses less digits than its factorization.
137796211509 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4175642787.
The product of its (nonzero) digits is 714420, while the sum is 51.
The spelling of 137796211509 in words is "one hundred thirty-seven billion, seven hundred ninety-six million, two hundred eleven thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •