Base | Representation |
---|---|
bin | 1000001001100001100… |
… | …0110101110100100000 |
3 | 111101100112102110010000 |
4 | 2002120120311310200 |
5 | 4243202333232313 |
6 | 144151343340000 |
7 | 13054135661520 |
oct | 2023030656440 |
9 | 441315373100 |
10 | 139995602208 |
11 | 5440a960000 |
12 | 231702b1600 |
13 | 102809b2357 |
14 | 6ac0c05680 |
15 | 3995653673 |
hex | 2098635d20 |
139995602208 has 1200 divisors, whose sum is σ = 565716856320. Its totient is φ = 33119539200.
The previous prime is 139995602183. The next prime is 139995602251. The reversal of 139995602208 is 802206599931.
It is a happy number.
139995602208 is a `hidden beast` number, since 1 + 3 + 9 + 9 + 9 + 5 + 602 + 20 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 199 ways as a sum of consecutive naturals, for example, 4515987153 + ... + 4515987183.
Almost surely, 2139995602208 is an apocalyptic number.
139995602208 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 139995602208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (282858428160).
139995602208 is an abundant number, since it is smaller than the sum of its proper divisors (425721254112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139995602208 is an equidigital number, since it uses as much as digits as its factorization.
139995602208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 2099520, while the sum is 54.
The spelling of 139995602208 in words is "one hundred thirty-nine billion, nine hundred ninety-five million, six hundred two thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.756 sec. • engine limits •