Base | Representation |
---|---|
bin | 1000011000100111101… |
… | …1011011110110001000 |
3 | 111202210221200120021010 |
4 | 2012021323123312020 |
5 | 4330002240324122 |
6 | 150101424043520 |
7 | 13256433425004 |
oct | 2061173336610 |
9 | 452727616233 |
10 | 144047979912 |
11 | 560aa369391 |
12 | 23b014635a0 |
13 | 10778412495 |
14 | 6d870b1704 |
15 | 3b312c2e0c |
hex | 2189edbd88 |
144047979912 has 32 divisors (see below), whose sum is σ = 360136270080. Its totient is φ = 48013817280.
The previous prime is 144047979893. The next prime is 144047979919. The reversal of 144047979912 is 219979740441.
144047979912 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (144047979919) by changing a digit.
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, 457462 + ... + 705242.
It is an arithmetic number, because the mean of its divisors is an integer number (11254258440).
Almost surely, 2144047979912 is an apocalyptic number.
144047979912 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144047979912 is an abundant number, since it is smaller than the sum of its proper divisors (216088290168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144047979912 is a wasteful number, since it uses less digits than its factorization.
144047979912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272013 (or 272009 counting only the distinct ones).
The product of its (nonzero) digits is 4572288, while the sum is 57.
The spelling of 144047979912 in words is "one hundred forty-four billion, forty-seven million, nine hundred seventy-nine thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •