Base | Representation |
---|---|
bin | 11111001001100111110100… |
… | …110010001000011011000001 |
3 | 122222002010200211220212210001 |
4 | 133021213310302020123001 |
5 | 120424104342211413123 |
6 | 1203213124244440001 |
7 | 40566654350160310 |
oct | 3711476462103301 |
9 | 588063624825701 |
10 | 137000678622913 |
11 | 3a71a730533a56 |
12 | 134477960a9001 |
13 | 5b5a154676a21 |
14 | 25b8c225a6277 |
15 | 10c8a7e6460ad |
hex | 7c99f4c886c1 |
137000678622913 has 4 divisors (see below), whose sum is σ = 156572204140480. Its totient is φ = 117429153105348.
The previous prime is 137000678622889. The next prime is 137000678622943. The reversal of 137000678622913 is 319226876000731.
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.
It is a de Polignac number, because none of the positive numbers 2k-137000678622913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (137000678622943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9785762758773 + ... + 9785762758786.
It is an arithmetic number, because the mean of its divisors is an integer number (39143051035120).
Almost surely, 2137000678622913 is an apocalyptic number.
It is an amenable number.
137000678622913 is a deficient number, since it is larger than the sum of its proper divisors (19571525517567).
137000678622913 is an equidigital number, since it uses as much as digits as its factorization.
137000678622913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19571525517566.
The product of its (nonzero) digits is 4572288, while the sum is 55.
The spelling of 137000678622913 in words is "one hundred thirty-seven trillion, six hundred seventy-eight million, six hundred twenty-two thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •