Base | Representation |
---|---|
bin | 100000101111111100101100… |
… | …000000010100110100100000 |
3 | 200212222100222020111002002122 |
4 | 200233330230000110310200 |
5 | 122334311442414213034 |
6 | 1230155333544003412 |
7 | 42224000535330050 |
oct | 4057745400246440 |
9 | 625870866432078 |
10 | 144032466554144 |
11 | 4199090a4a6543 |
12 | 141a2559760568 |
13 | 624a2848c00cc |
14 | 277d2cc49b560 |
15 | 119b9358e162e |
hex | 82ff2c014d20 |
144032466554144 has 96 divisors (see below), whose sum is σ = 338169213639936. Its totient is φ = 59043312092160.
The previous prime is 144032466554143. The next prime is 144032466554147. The reversal of 144032466554144 is 441455664230441.
It is not an unprimeable number, because it can be changed into a prime (144032466554143) 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 15 ways as a sum of consecutive naturals, for example, 331473794 + ... + 331908030.
It is an arithmetic number, because the mean of its divisors is an integer number (3522595975416).
Almost surely, 2144032466554144 is an apocalyptic number.
144032466554144 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
144032466554144 is an abundant number, since it is smaller than the sum of its proper divisors (194136747085792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144032466554144 is a wasteful number, since it uses less digits than its factorization.
144032466554144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 498658 (or 498650 counting only the distinct ones).
The product of its (nonzero) digits is 22118400, while the sum is 53.
The spelling of 144032466554144 in words is "one hundred forty-four trillion, thirty-two billion, four hundred sixty-six million, five hundred fifty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •