Base | Representation |
---|---|
bin | 1000001001111011100… |
… | …0101110010010110000 |
3 | 111101122010120021220111 |
4 | 2002132320232102300 |
5 | 4243413240421110 |
6 | 144210240151104 |
7 | 13056631435306 |
oct | 2023670562260 |
9 | 441563507814 |
10 | 140104623280 |
11 | 54466453166 |
12 | 231a0908494 |
13 | 1029a463c6b |
14 | 6ad14a4276 |
15 | 399eedae8a |
hex | 209ee2e4b0 |
140104623280 has 160 divisors (see below), whose sum is σ = 351211521024. Its totient is φ = 51839935488.
The previous prime is 140104623277. The next prime is 140104623301. The reversal of 140104623280 is 82326401041.
It is a super-3 number, since 3×1401046232803 (a number of 34 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11363199 + ... + 11375521.
Almost surely, 2140104623280 is an apocalyptic number.
140104623280 is a gapful number since it is divisible by the number (10) 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 140104623280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175605760512).
140104623280 is an abundant number, since it is smaller than the sum of its proper divisors (211106897744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140104623280 is a wasteful number, since it uses less digits than its factorization.
140104623280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12563 (or 12557 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 31.
The spelling of 140104623280 in words is "one hundred forty billion, one hundred four million, six hundred twenty-three thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •