Base | Representation |
---|---|
bin | 100000110101111010010100… |
… | …100010011110101101000110 |
3 | 200221102112200012201021212022 |
4 | 200311322110202132231012 |
5 | 122413020203002343420 |
6 | 1231111503334523142 |
7 | 42265415262163025 |
oct | 4065722442365506 |
9 | 627375605637768 |
10 | 144442242231110 |
11 | 4202967a15770a |
12 | 14249a5a8064b2 |
13 | 6279aca5c6595 |
14 | 2795082aac8bc |
15 | 11a741a636c25 |
hex | 835e9489eb46 |
144442242231110 has 32 divisors (see below), whose sum is σ = 260814803558400. Its totient is φ = 57595214759008.
The previous prime is 144442242231103. The next prime is 144442242231127. The reversal of 144442242231110 is 11132242244441.
It is a happy number.
It is a super-2 number, since 2×1444422422311102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 12296510 + ... + 20978289.
It is an arithmetic number, because the mean of its divisors is an integer number (8150462611200).
Almost surely, 2144442242231110 is an apocalyptic number.
144442242231110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144442242231110 is a deficient number, since it is larger than the sum of its proper divisors (116372561327290).
144442242231110 is a wasteful number, since it uses less digits than its factorization.
144442242231110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33276172.
The product of its (nonzero) digits is 49152, while the sum is 35.
Adding to 144442242231110 its reverse (11132242244441), we get a palindrome (155574484475551).
The spelling of 144442242231110 in words is "one hundred forty-four trillion, four hundred forty-two billion, two hundred forty-two million, two hundred thirty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •