Base | Representation |
---|---|
bin | 1000001011001101000… |
… | …1011000111111101000 |
3 | 111102111222010020100201 |
4 | 2002303101120333220 |
5 | 4300113314241320 |
6 | 144304214441544 |
7 | 13101253456063 |
oct | 2026321307750 |
9 | 442458106321 |
10 | 140446633960 |
11 | 54621510916 |
12 | 232773632b4 |
13 | 10323280849 |
14 | 6b24a918da |
15 | 39c004770a |
hex | 20b3458fe8 |
140446633960 has 64 divisors (see below), whose sum is σ = 319958916480. Its totient is φ = 55476345600.
The previous prime is 140446633931. The next prime is 140446633973. The reversal of 140446633960 is 69336644041.
It is a self number, because there is not a number n which added to its sum of digits gives 140446633960.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8301510 + ... + 8318410.
It is an arithmetic number, because the mean of its divisors is an integer number (4999358070).
Almost surely, 2140446633960 is an apocalyptic number.
140446633960 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 140446633960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159979458240).
140446633960 is an abundant number, since it is smaller than the sum of its proper divisors (179512282520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140446633960 is a wasteful number, since it uses less digits than its factorization.
140446633960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19498 (or 19494 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 46.
The spelling of 140446633960 in words is "one hundred forty billion, four hundred forty-six million, six hundred thirty-three thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •