Base | Representation |
---|---|
bin | 1000011001100011110… |
… | …0110111101011011100 |
3 | 111210110111221020110002 |
4 | 2012120330313223130 |
5 | 4331011300424200 |
6 | 150142430033432 |
7 | 13265613612101 |
oct | 2063074675334 |
9 | 453414836402 |
10 | 144300014300 |
11 | 56219661572 |
12 | 23b71948878 |
13 | 107b86b7b60 |
14 | 6dac75aaa8 |
15 | 3b484a9bd5 |
hex | 2198f37adc |
144300014300 has 72 divisors (see below), whose sum is σ = 338913204000. Its totient is φ = 53012171520.
The previous prime is 144300014293. The next prime is 144300014333. The reversal of 144300014300 is 3410003441.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20195 + ... + 537594.
Almost surely, 2144300014300 is an apocalyptic number.
144300014300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144300014300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169456602000).
144300014300 is an abundant number, since it is smaller than the sum of its proper divisors (194613189700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144300014300 is a wasteful number, since it uses less digits than its factorization.
144300014300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558015 (or 558008 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 144300014300 its reverse (3410003441), we get a palindrome (147710017741).
The spelling of 144300014300 in words is "one hundred forty-four billion, three hundred million, fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •