Base | Representation |
---|---|
bin | 111111110011010010… |
… | …0010001101111001010 |
3 | 111002122121201202001112 |
4 | 1333212210101233022 |
5 | 4221100114140230 |
6 | 142535332050322 |
7 | 12620201646332 |
oct | 1774644215712 |
9 | 432577652045 |
10 | 137012255690 |
11 | 53119934672 |
12 | 226791639a2 |
13 | cbc68abc5b |
14 | 68ba8d60c2 |
15 | 386d79dd95 |
hex | 1fe6911bca |
137012255690 has 8 divisors (see below), whose sum is σ = 246622060260. Its totient is φ = 54804902272.
The previous prime is 137012255641. The next prime is 137012255741. The reversal of 137012255690 is 96552210731.
It can be written as a sum of positive squares in 2 ways, for example, as 131626016809 + 5386238881 = 362803^2 + 73391^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1370122556902 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6850612775 + ... + 6850612794.
Almost surely, 2137012255690 is an apocalyptic number.
137012255690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
137012255690 is a deficient number, since it is larger than the sum of its proper divisors (109609804570).
137012255690 is a wasteful number, since it uses less digits than its factorization.
137012255690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13701225576.
The product of its (nonzero) digits is 113400, while the sum is 41.
The spelling of 137012255690 in words is "one hundred thirty-seven billion, twelve million, two hundred fifty-five thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •