Base | Representation |
---|---|
bin | 1000011001101100001… |
… | …0100001110110110010 |
3 | 111210112221212100102110 |
4 | 2012123002201312302 |
5 | 4331044233132320 |
6 | 150150121030150 |
7 | 13266520462326 |
oct | 2063302416662 |
9 | 453487770373 |
10 | 144335052210 |
11 | 56237413018 |
12 | 23b81625356 |
13 | 107c2a34c4b |
14 | 6db327b986 |
15 | 3b4b5cb5e0 |
hex | 219b0a1db2 |
144335052210 has 16 divisors (see below), whose sum is σ = 346404125376. Its totient is φ = 38489347248.
The previous prime is 144335052193. The next prime is 144335052221. The reversal of 144335052210 is 12250533441.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 4811168407 = 144335052210 / (1 + 4 + 4 + 3 + 3 + 5 + 0 + 5 + 2 + 2 + 1 + 0).
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 7 ways as a sum of consecutive naturals, for example, 2405584174 + ... + 2405584233.
It is an arithmetic number, because the mean of its divisors is an integer number (21650257836).
Almost surely, 2144335052210 is an apocalyptic number.
144335052210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144335052210 is an abundant number, since it is smaller than the sum of its proper divisors (202069073166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144335052210 is a wasteful number, since it uses less digits than its factorization.
144335052210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4811168417.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 144335052210 its reverse (12250533441), we get a palindrome (156585585651).
The spelling of 144335052210 in words is "one hundred forty-four billion, three hundred thirty-five million, fifty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •