Base | Representation |
---|---|
bin | 1000011001100111011… |
… | …1000000001000110100 |
3 | 111210111120121110102111 |
4 | 2012121313000020310 |
5 | 4331024201101200 |
6 | 150144132420404 |
7 | 13266160261501 |
oct | 2063167001064 |
9 | 453446543374 |
10 | 144315253300 |
11 | 5622721a889 |
12 | 23b76a77704 |
13 | 107bb8c220a |
14 | 6db07a64a8 |
15 | 3b499ba0ba |
hex | 2199dc0234 |
144315253300 has 36 divisors (see below), whose sum is σ = 316682816940. Its totient is φ = 57077489920.
The previous prime is 144315253297. The next prime is 144315253309. The reversal of 144315253300 is 3352513441.
It can be written as a sum of positive squares in 6 ways, for example, as 20429556624 + 123885696676 = 142932^2 + 351974^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144315253309) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8098699 + ... + 8116498.
It is an arithmetic number, because the mean of its divisors is an integer number (8796744915).
Almost surely, 2144315253300 is an apocalyptic number.
144315253300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144315253300 is an abundant number, since it is smaller than the sum of its proper divisors (172367563640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144315253300 is a wasteful number, since it uses less digits than its factorization.
144315253300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16215300 (or 16215293 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 144315253300 its reverse (3352513441), we get a palindrome (147667766741).
The spelling of 144315253300 in words is "one hundred forty-four billion, three hundred fifteen million, two hundred fifty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •