Base | Representation |
---|---|
bin | 1000011000111001001… |
… | …0011110110001111010 |
3 | 111210000001022222110120 |
4 | 2012032102132301322 |
5 | 4330130002130411 |
6 | 150112555554110 |
7 | 13261312251612 |
oct | 2061622366172 |
9 | 453001288416 |
10 | 144121130106 |
11 | 56137691198 |
12 | 23b21a5b936 |
13 | 1078a614b15 |
14 | 6d92ab3a42 |
15 | 3b37922106 |
hex | 218e49ec7a |
144121130106 has 8 divisors (see below), whose sum is σ = 288242260224. Its totient is φ = 48040376700.
The previous prime is 144121130099. The next prime is 144121130173. The reversal of 144121130106 is 601031121441.
It is a happy number.
144121130106 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
144121130106 is an admirable number.
It is a Curzon number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 12010094170 + ... + 12010094181.
It is an arithmetic number, because the mean of its divisors is an integer number (36030282528).
Almost surely, 2144121130106 is an apocalyptic number.
144121130106 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144121130106 is a wasteful number, since it uses less digits than its factorization.
144121130106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24020188356.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 144121130106 its reverse (601031121441), we get a palindrome (745152251547).
The spelling of 144121130106 in words is "one hundred forty-four billion, one hundred twenty-one million, one hundred thirty thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •