Base | Representation |
---|---|
bin | 1000001010000000001… |
… | …0110000100110101000 |
3 | 111101200111002022211202 |
4 | 2002200002300212220 |
5 | 4243433223001100 |
6 | 144212212143332 |
7 | 13060255420613 |
oct | 2024002604650 |
9 | 441614068752 |
10 | 140124031400 |
11 | 544763a9831 |
12 | 231a7307b48 |
13 | 102a149ab62 |
14 | 6ad3cb717a |
15 | 39a1a717d5 |
hex | 20a00b09a8 |
140124031400 has 48 divisors (see below), whose sum is σ = 326168037600. Its totient is φ = 55984294080.
The previous prime is 140124031381. The next prime is 140124031403. The reversal of 140124031400 is 4130421041.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (140124031403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 236012 + ... + 579611.
It is an arithmetic number, because the mean of its divisors is an integer number (6795167450).
Almost surely, 2140124031400 is an apocalyptic number.
140124031400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140124031400 is an abundant number, since it is smaller than the sum of its proper divisors (186044006200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140124031400 is a wasteful number, since it uses less digits than its factorization.
140124031400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 816498 (or 816489 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 140124031400 its reverse (4130421041), we get a palindrome (144254452441).
The spelling of 140124031400 in words is "one hundred forty billion, one hundred twenty-four million, thirty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •