Base | Representation |
---|---|
bin | 11111010011011000011111… |
… | …110101000100001111001110 |
3 | 200001110020222200002022110102 |
4 | 133103120133311010033032 |
5 | 121021102024410220140 |
6 | 1204445213020211102 |
7 | 40666301010305012 |
oct | 3723303765041716 |
9 | 601406880068412 |
10 | 137671415710670 |
11 | 3a95913509a556 |
12 | 13535786699a92 |
13 | 5ba848837507a |
14 | 25dd4912d2542 |
15 | 10db239670e15 |
hex | 7d361fd443ce |
137671415710670 has 8 divisors (see below), whose sum is σ = 247808548279224. Its totient is φ = 55068566284264.
The previous prime is 137671415710669. The next prime is 137671415710679. The reversal of 137671415710670 is 76017514176731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1376714157106703 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137671415710679) 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, 6883570785524 + ... + 6883570785543.
It is an arithmetic number, because the mean of its divisors is an integer number (30976068534903).
Almost surely, 2137671415710670 is an apocalyptic number.
137671415710670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
137671415710670 is a deficient number, since it is larger than the sum of its proper divisors (110137132568554).
137671415710670 is a wasteful number, since it uses less digits than its factorization.
137671415710670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13767141571074.
The product of its (nonzero) digits is 5186160, while the sum is 56.
The spelling of 137671415710670 in words is "one hundred thirty-seven trillion, six hundred seventy-one billion, four hundred fifteen million, seven hundred ten thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •