Base | Representation |
---|---|
bin | 1000001011011111000… |
… | …1011010001111111010 |
3 | 111102201020012011110200 |
4 | 2002313301122033322 |
5 | 4300242131332240 |
6 | 144315513023030 |
7 | 13103161311234 |
oct | 2026761321772 |
9 | 442636164420 |
10 | 140522136570 |
11 | 546600a0072 |
12 | 232986b4a76 |
13 | 10335ac7b4a |
14 | 6b30b07254 |
15 | 39c69ad930 |
hex | 20b7c5a3fa |
140522136570 has 96 divisors (see below), whose sum is σ = 370170912384. Its totient is φ = 36979900800.
The previous prime is 140522136541. The next prime is 140522136649. The reversal of 140522136570 is 75631225041.
140522136570 is a `hidden beast` number, since 1 + 4 + 0 + 5 + 221 + 365 + 70 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7019275 + ... + 7039265.
It is an arithmetic number, because the mean of its divisors is an integer number (3855947004).
Almost surely, 2140522136570 is an apocalyptic number.
140522136570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 140522136570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185085456192).
140522136570 is an abundant number, since it is smaller than the sum of its proper divisors (229648775814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140522136570 is a wasteful number, since it uses less digits than its factorization.
140522136570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21028 (or 21025 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 140522136570 in words is "one hundred forty billion, five hundred twenty-two million, one hundred thirty-six thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •