Base | Representation |
---|---|
bin | 1000011011111000011… |
… | …1110110101100111000 |
3 | 111212001222102020222220 |
4 | 2012332013312230320 |
5 | 4333300423311442 |
6 | 150324344444040 |
7 | 13320225464400 |
oct | 2067607665470 |
9 | 455058366886 |
10 | 144923650872 |
11 | 565096939a0 |
12 | 24106779620 |
13 | 1088796b190 |
14 | 702b4d7800 |
15 | 3b830e5eec |
hex | 21be1f6b38 |
144923650872 has 384 divisors, whose sum is σ = 507244550400. Its totient is φ = 33897830400.
The previous prime is 144923650777. The next prime is 144923650901. The reversal of 144923650872 is 278056329441.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6884379 + ... + 6905397.
It is an arithmetic number, because the mean of its divisors is an integer number (1320949350).
It is a 1-persistent number, because it is pandigital, but 2⋅144923650872 = 289847301744 is not.
Almost surely, 2144923650872 is an apocalyptic number.
144923650872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144923650872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (253622275200).
144923650872 is an abundant number, since it is smaller than the sum of its proper divisors (362320899528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144923650872 is a wasteful number, since it uses less digits than its factorization.
144923650872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21107 (or 21096 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 51.
The spelling of 144923650872 in words is "one hundred forty-four billion, nine hundred twenty-three million, six hundred fifty thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •