Base | Representation |
---|---|
bin | 1000000000010101001… |
… | …0101110111000000101 |
3 | 111010222112201120111220 |
4 | 2000011102232320011 |
5 | 4223124101001044 |
6 | 143102424550553 |
7 | 12636031405536 |
oct | 2000522567005 |
9 | 433875646456 |
10 | 137527750149 |
11 | 53363914249 |
12 | 227a1922459 |
13 | cc7962a76a |
14 | 692916268d |
15 | 389db78019 |
hex | 20054aee05 |
137527750149 has 4 divisors (see below), whose sum is σ = 183370333536. Its totient is φ = 91685166764.
The previous prime is 137527750133. The next prime is 137527750229. The reversal of 137527750149 is 941057725731.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 941057725731 = 3 ⋅313685908577.
It is a cyclic number.
It is not a de Polignac number, because 137527750149 - 24 = 137527750133 is a prime.
It is a super-2 number, since 2×1375277501492 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137527750109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22921291689 + ... + 22921291694.
It is an arithmetic number, because the mean of its divisors is an integer number (45842583384).
Almost surely, 2137527750149 is an apocalyptic number.
It is an amenable number.
137527750149 is a deficient number, since it is larger than the sum of its proper divisors (45842583387).
137527750149 is an equidigital number, since it uses as much as digits as its factorization.
137527750149 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45842583386.
The product of its (nonzero) digits is 1852200, while the sum is 51.
The spelling of 137527750149 in words is "one hundred thirty-seven billion, five hundred twenty-seven million, seven hundred fifty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •