Base | Representation |
---|---|
bin | 10010001111011100110… |
… | …100000100101000111110 |
3 | 11102211121100220001212110 |
4 | 102033130310010220332 |
5 | 131014222232334100 |
6 | 2355511323114450 |
7 | 156364615136502 |
oct | 22173464045076 |
9 | 4384540801773 |
10 | 1253540121150 |
11 | 44369479a5a9 |
12 | 182b40072a26 |
13 | 91292900a75 |
14 | 4495909c302 |
15 | 2291a265250 |
hex | 123dcd04a3e |
1253540121150 has 48 divisors (see below), whose sum is σ = 3272399481600. Its totient is φ = 316683819360.
The previous prime is 1253540121137. The next prime is 1253540121157. The reversal of 1253540121150 is 511210453521.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1253540121157) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 219916470 + ... + 219922169.
It is an arithmetic number, because the mean of its divisors is an integer number (68174989200).
Almost surely, 21253540121150 is an apocalyptic number.
1253540121150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1253540121150 is an abundant number, since it is smaller than the sum of its proper divisors (2018859360450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1253540121150 is a wasteful number, since it uses less digits than its factorization.
1253540121150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439838673 (or 439838668 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 1253540121150 its reverse (511210453521), we get a palindrome (1764750574671).
The spelling of 1253540121150 in words is "one trillion, two hundred fifty-three billion, five hundred forty million, one hundred twenty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •