Base | Representation |
---|---|
bin | 10000101111100… |
… | …00001100000000 |
3 | 100210021022112001 |
4 | 20113300030000 |
5 | 241423210131 |
6 | 21534113344 |
7 | 3323520640 |
oct | 1027601400 |
9 | 323238461 |
10 | 140444416 |
11 | 72305a72 |
12 | 3b04b854 |
13 | 23134708 |
14 | 1491c520 |
15 | c4e3261 |
hex | 85f0300 |
140444416 has 72 divisors (see below), whose sum is σ = 322902944. Its totient is φ = 59719680.
The previous prime is 140444411. The next prime is 140444443. The reversal of 140444416 is 614444041.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (140444411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 324136 + ... + 324568.
Almost surely, 2140444416 is an apocalyptic number.
140444416 is a gapful number since it is divisible by the number (16) 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 140444416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161451472).
140444416 is an abundant number, since it is smaller than the sum of its proper divisors (182458528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140444416 is an equidigital number, since it uses as much as digits as its factorization.
140444416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637 (or 623 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
The square root of 140444416 is about 11850.9246896603. The cubic root of 140444416 is about 519.7982649419.
Adding to 140444416 its reverse (614444041), we get a palindrome (754888457).
The spelling of 140444416 in words is "one hundred forty million, four hundred forty-four thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •