Base | Representation |
---|---|
bin | 1000010000111111110… |
… | …0101111111100000000 |
3 | 111120112022212211001222 |
4 | 2010033330233330000 |
5 | 4311304341112000 |
6 | 145122401014212 |
7 | 13154633603636 |
oct | 2041774577400 |
9 | 446468784058 |
10 | 142001504000 |
11 | 5524a168784 |
12 | 23630024368 |
13 | 10510444aa5 |
14 | 6c31399356 |
15 | 3a617cea85 |
hex | 210ff2ff00 |
142001504000 has 72 divisors (see below), whose sum is σ = 353743576368. Its totient is φ = 56800588800.
The previous prime is 142001503967. The next prime is 142001504083. The reversal of 142001504000 is 405100241.
142001504000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 142001504000.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 2186774 + ... + 2250773.
Almost surely, 2142001504000 is an apocalyptic number.
142001504000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142001504000 is an abundant number, since it is smaller than the sum of its proper divisors (211742072368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142001504000 is an frugal number, since it uses more digits than its factorization.
142001504000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4437578 (or 4437554 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 142001504000 its reverse (405100241), we get a palindrome (142406604241).
The spelling of 142001504000 in words is "one hundred forty-two billion, one million, five hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •