Base | Representation |
---|---|
bin | 11111110101101111011100… |
… | …001001101010010101010100 |
3 | 200100210222101112211001212022 |
4 | 133311233130021222111110 |
5 | 121323243041120143300 |
6 | 1213454014213512312 |
7 | 41332005124034156 |
oct | 3765573411522524 |
9 | 610728345731768 |
10 | 140032512271700 |
11 | 406895005a0184 |
12 | 138572a5042698 |
13 | 601a0174107a9 |
14 | 268187725cad6 |
15 | 112c878967285 |
hex | 7f5bdc26a554 |
140032512271700 has 36 divisors (see below), whose sum is σ = 304062510628800. Its totient is φ = 55977620761440.
The previous prime is 140032512271681. The next prime is 140032512271709. The reversal of 140032512271700 is 7172215230041.
It is a super-2 number, since 2×1400325122717002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140032512271709) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 442142750 + ... + 442459349.
It is an arithmetic number, because the mean of its divisors is an integer number (8446180850800).
Almost surely, 2140032512271700 is an apocalyptic number.
140032512271700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140032512271700 is an abundant number, since it is smaller than the sum of its proper divisors (164029998357100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140032512271700 is a wasteful number, since it uses less digits than its factorization.
140032512271700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884603696 (or 884603689 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 35.
The spelling of 140032512271700 in words is "one hundred forty trillion, thirty-two billion, five hundred twelve million, two hundred seventy-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •