Base | Representation |
---|---|
bin | 1000001011101001010… |
… | …1110001010010100000 |
3 | 111102211020021011100002 |
4 | 2002322111301102200 |
5 | 4300334144110220 |
6 | 144324052315132 |
7 | 13104223451330 |
oct | 2027225612240 |
9 | 442736234302 |
10 | 140565222560 |
11 | 54682449224 |
12 | 232ab012aa8 |
13 | 10341a02209 |
14 | 6b367210c0 |
15 | 39ca66ec75 |
hex | 20ba5714a0 |
140565222560 has 192 divisors, whose sum is σ = 393105726720. Its totient is φ = 46473584640.
The previous prime is 140565222521. The next prime is 140565222569. The reversal of 140565222560 is 65222565041.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (140565222569) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31535852 + ... + 31540308.
It is an arithmetic number, because the mean of its divisors is an integer number (2047425660).
Almost surely, 2140565222560 is an apocalyptic number.
140565222560 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 140565222560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196552863360).
140565222560 is an abundant number, since it is smaller than the sum of its proper divisors (252540504160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140565222560 is a wasteful number, since it uses less digits than its factorization.
140565222560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5479 (or 5471 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 140565222560 in words is "one hundred forty billion, five hundred sixty-five million, two hundred twenty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •