Base | Representation |
---|---|
bin | 1000001011001101111… |
… | …1001011111010100000 |
3 | 111102112012220222011221 |
4 | 2002303133023322200 |
5 | 4300120231003100 |
6 | 144304424144424 |
7 | 13101326300455 |
oct | 2026337137240 |
9 | 442465828157 |
10 | 140450250400 |
11 | 54623560a09 |
12 | 23278608114 |
13 | 10323c48955 |
14 | 6b2535382c |
15 | 39c050e01a |
hex | 20b37cbea0 |
140450250400 has 72 divisors (see below), whose sum is σ = 350169462720. Its totient is φ = 54984764160.
The previous prime is 140450250397. The next prime is 140450250427. The reversal of 140450250400 is 4052054041.
It is a happy number.
140450250400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1830090 + ... + 1905289.
It is an arithmetic number, because the mean of its divisors is an integer number (4863464760).
Almost surely, 2140450250400 is an apocalyptic number.
140450250400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
140450250400 is an abundant number, since it is smaller than the sum of its proper divisors (209719212320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140450250400 is a wasteful number, since it uses less digits than its factorization.
140450250400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3735446 (or 3735433 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
The spelling of 140450250400 in words is "one hundred forty billion, four hundred fifty million, two hundred fifty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •