Base | Representation |
---|---|
bin | 1000000000001110010… |
… | …0101010000110001011 |
3 | 111010220112102120022201 |
4 | 2000003210222012023 |
5 | 4223044204112411 |
6 | 143055514301031 |
7 | 12635231215132 |
oct | 2000344520613 |
9 | 433815376281 |
10 | 137498894731 |
11 | 533495a57a0 |
12 | 22794127777 |
13 | cc73666753 |
14 | 69253b0919 |
15 | 389b3783c1 |
hex | 200392a18b |
137498894731 has 8 divisors (see below), whose sum is σ = 150376629744. Its totient is φ = 124684132320.
The previous prime is 137498894717. The next prime is 137498894747.
It is a happy number.
137498894731 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-137498894731 is a prime.
It is a super-2 number, since 2×1374988947312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (137498894761) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 15738580 + ... + 15747313.
It is an arithmetic number, because the mean of its divisors is an integer number (18797078718).
Almost surely, 2137498894731 is an apocalyptic number.
137498894731 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
137498894731 is a deficient number, since it is larger than the sum of its proper divisors (12877735013).
137498894731 is a wasteful number, since it uses less digits than its factorization.
137498894731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31486301.
The product of its digits is 36578304, while the sum is 64.
The spelling of 137498894731 in words is "one hundred thirty-seven billion, four hundred ninety-eight million, eight hundred ninety-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •