Base | Representation |
---|---|
bin | 1000011001010110111… |
… | …1101000001000011100 |
3 | 111210022202200202022222 |
4 | 2012111233220020130 |
5 | 4330404012223400 |
6 | 150133224524512 |
7 | 13264361364335 |
oct | 2062557501034 |
9 | 453282622288 |
10 | 144246211100 |
11 | 561a1253412 |
12 | 23b57920738 |
13 | 107aa4ca644 |
14 | 6da555328c |
15 | 3b438cd185 |
hex | 2195be821c |
144246211100 has 72 divisors (see below), whose sum is σ = 315212356368. Its totient is φ = 57294720000.
The previous prime is 144246211099. The next prime is 144246211121. The reversal of 144246211100 is 1112642441.
It is a self number, because there is not a number n which added to its sum of digits gives 144246211100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8450174 + ... + 8467226.
It is an arithmetic number, because the mean of its divisors is an integer number (4377949394).
Almost surely, 2144246211100 is an apocalyptic number.
144246211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144246211100 is an abundant number, since it is smaller than the sum of its proper divisors (170966145268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144246211100 is a wasteful number, since it uses less digits than its factorization.
144246211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17655 (or 17648 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 144246211100 its reverse (1112642441), we get a palindrome (145358853541).
The spelling of 144246211100 in words is "one hundred forty-four billion, two hundred forty-six million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •