Base | Representation |
---|---|
bin | 1000000110000010110… |
… | …1000100011000000000 |
3 | 111021221102112002000000 |
4 | 2001200231010120000 |
5 | 4234244203134413 |
6 | 143514532000000 |
7 | 13022033142423 |
oct | 2014055043000 |
9 | 437842462000 |
10 | 139061380608 |
11 | 53a80584537 |
12 | 22b4b460000 |
13 | 101622962c7 |
14 | 6a32adb9ba |
15 | 393d617073 |
hex | 2060b44600 |
139061380608 has 280 divisors, whose sum is σ = 438534115800. Its totient is φ = 43911880704.
The previous prime is 139061380607. The next prime is 139061380637. The reversal of 139061380608 is 806083160931.
It is a happy number.
139061380608 is a `hidden beast` number, since 1 + 3 + 9 + 0 + 6 + 1 + 38 + 0 + 608 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139061380603) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 7081908 + ... + 7101516.
Almost surely, 2139061380608 is an apocalyptic number.
139061380608 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139061380608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219267057900).
139061380608 is an abundant number, since it is smaller than the sum of its proper divisors (299472735192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139061380608 is an frugal number, since it uses more digits than its factorization.
139061380608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19664 (or 19633 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 45.
The spelling of 139061380608 in words is "one hundred thirty-nine billion, sixty-one million, three hundred eighty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •