Base | Representation |
---|---|
bin | 100000110100011100000100… |
… | …100111100111010001011010 |
3 | 200221001212110111021112020010 |
4 | 200310130010213213101122 |
5 | 122404340424103110020 |
6 | 1230553205424542350 |
7 | 42255203420326206 |
oct | 4064340447472132 |
9 | 627055414245203 |
10 | 144341043410010 |
11 | 41a9a769050577 |
12 | 142323174819b6 |
13 | 62703c0616155 |
14 | 2790202747b06 |
15 | 11a4996045de0 |
hex | 8347049e745a |
144341043410010 has 64 divisors (see below), whose sum is σ = 348358542497280. Its totient is φ = 38275390950720.
The previous prime is 144341043409957. The next prime is 144341043410021. The reversal of 144341043410010 is 10014340143441.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 144341043410010.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 547022769 + ... + 547286571.
It is an arithmetic number, because the mean of its divisors is an integer number (5443102226520).
Almost surely, 2144341043410010 is an apocalyptic number.
144341043410010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144341043410010 is an abundant number, since it is smaller than the sum of its proper divisors (204017499087270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144341043410010 is a wasteful number, since it uses less digits than its factorization.
144341043410010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365883.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 144341043410010 its reverse (10014340143441), we get a palindrome (154355383553451).
The spelling of 144341043410010 in words is "one hundred forty-four trillion, three hundred forty-one billion, forty-three million, four hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •