Base | Representation |
---|---|
bin | 1110101111100111110… |
… | …0010110110101110000 |
3 | 220012211000101000001121 |
4 | 3223321330112311300 |
5 | 13122230132432034 |
6 | 312210505112024 |
7 | 24205021550446 |
oct | 3537174266560 |
9 | 805730330047 |
10 | 253301452144 |
11 | 984740800a4 |
12 | 41112188614 |
13 | 1ab6a05c180 |
14 | c38d088b96 |
15 | 68c7aa71b4 |
hex | 3af9f16d70 |
253301452144 has 80 divisors (see below), whose sum is σ = 556947165600. Its totient is φ = 110634467328.
The previous prime is 253301452127. The next prime is 253301452189. The reversal of 253301452144 is 441254103352.
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, 3636912 + ... + 3705904.
It is an arithmetic number, because the mean of its divisors is an integer number (6961839570).
Almost surely, 2253301452144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 253301452144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (278473582800).
253301452144 is an abundant number, since it is smaller than the sum of its proper divisors (303645713456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253301452144 is a wasteful number, since it uses less digits than its factorization.
253301452144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69962 (or 69956 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 253301452144 its reverse (441254103352), we get a palindrome (694555555496).
The spelling of 253301452144 in words is "two hundred fifty-three billion, three hundred one million, four hundred fifty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •