Base | Representation |
---|---|
bin | 1000000001011001010… |
… | …1011110010100100111 |
3 | 111011201110202101111222 |
4 | 2000112111132110213 |
5 | 4224220300301242 |
6 | 143151041250555 |
7 | 12646102651511 |
oct | 2002625362447 |
9 | 434643671458 |
10 | 137813681447 |
11 | 534a0259702 |
12 | 22861633a5b |
13 | ccc3940a90 |
14 | 6955112bb1 |
15 | 38b8d085d2 |
hex | 201655e527 |
137813681447 has 4 divisors (see below), whose sum is σ = 148414733880. Its totient is φ = 127212629016.
The previous prime is 137813681443. The next prime is 137813681461. The reversal of 137813681447 is 744186318731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 744186318731 = 717109 ⋅1037759.
It is a cyclic number.
It is not a de Polignac number, because 137813681447 - 22 = 137813681443 is a prime.
It is a super-2 number, since 2×1378136814472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137813681443) 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, 5300526197 + ... + 5300526222.
It is an arithmetic number, because the mean of its divisors is an integer number (37103683470).
Almost surely, 2137813681447 is an apocalyptic number.
137813681447 is a deficient number, since it is larger than the sum of its proper divisors (10601052433).
137813681447 is a wasteful number, since it uses less digits than its factorization.
137813681447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10601052432.
The product of its digits is 2709504, while the sum is 53.
The spelling of 137813681447 in words is "one hundred thirty-seven billion, eight hundred thirteen million, six hundred eighty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •