Base | Representation |
---|---|
bin | 1000011011011111010… |
… | …1111110111000100011 |
3 | 111211210122012000012022 |
4 | 2012313311332320203 |
5 | 4333041441134444 |
6 | 150310102452055 |
7 | 13314506155313 |
oct | 2066765767043 |
9 | 454718160168 |
10 | 144818302499 |
11 | 5646517a122 |
12 | 2409743402b |
13 | 1086bba4170 |
14 | 701b513443 |
15 | 3b78c369ee |
hex | 21b7d7ee23 |
144818302499 has 32 divisors (see below), whose sum is σ = 166838683200. Its totient is φ = 124590182400.
The previous prime is 144818302493. The next prime is 144818302523. The reversal of 144818302499 is 994203818441.
It is a Cunningham number, because it is equal to 3805502-1.
It is a cyclic number.
It is not a de Polignac number, because 144818302499 - 24 = 144818302483 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 144818302499.
It is not an unprimeable number, because it can be changed into a prime (144818302493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7220417 + ... + 7240445.
It is an arithmetic number, because the mean of its divisors is an integer number (5213708850).
Almost surely, 2144818302499 is an apocalyptic number.
144818302499 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
144818302499 is a deficient number, since it is larger than the sum of its proper divisors (22020380701).
144818302499 is a wasteful number, since it uses less digits than its factorization.
144818302499 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20535.
The product of its (nonzero) digits is 1990656, while the sum is 53.
The spelling of 144818302499 in words is "one hundred forty-four billion, eight hundred eighteen million, three hundred two thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •