Base | Representation |
---|---|
bin | 1000000000000010001… |
… | …0101100010001110111 |
3 | 111010202222202021100122 |
4 | 2000000202230101313 |
5 | 4222443200011420 |
6 | 143050500402155 |
7 | 12634043062145 |
oct | 2000042542167 |
9 | 433688667318 |
10 | 137448047735 |
11 | 53322926689 |
12 | 2277b0a635b |
13 | cc65c7297b |
14 | 691c736595 |
15 | 3896b82725 |
hex | 20008ac477 |
137448047735 has 4 divisors (see below), whose sum is σ = 164937657288. Its totient is φ = 109958438184.
The previous prime is 137448047729. The next prime is 137448047741. The reversal of 137448047735 is 537740844731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 537740844731 = 7027 ⋅76524953.
It is an interprime number because it is at equal distance from previous prime (137448047729) and next prime (137448047741).
It is a cyclic number.
It is not a de Polignac number, because 137448047735 - 214 = 137448031351 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13744804769 + ... + 13744804778.
It is an arithmetic number, because the mean of its divisors is an integer number (41234414322).
Almost surely, 2137448047735 is an apocalyptic number.
137448047735 is a deficient number, since it is larger than the sum of its proper divisors (27489609553).
137448047735 is an equidigital number, since it uses as much as digits as its factorization.
137448047735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27489609552.
The product of its (nonzero) digits is 7902720, while the sum is 53.
The spelling of 137448047735 in words is "one hundred thirty-seven billion, four hundred forty-eight million, forty-seven thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •