Base | Representation |
---|---|
bin | 11110101001110100010… |
… | …01100100100101000000 |
3 | 10201200121021201111000111 |
4 | 33110322021210211000 |
5 | 114224020044401133 |
6 | 2123504123401104 |
7 | 136044222113500 |
oct | 17247211444500 |
9 | 3650537644014 |
10 | 1053242575168 |
11 | 37674aa80733 |
12 | 150160983194 |
13 | 78421a62aa4 |
14 | 38d97685a00 |
15 | 1c5e5b191cd |
hex | f53a264940 |
1053242575168 has 84 divisors (see below), whose sum is σ = 2487798521472. Its totient is φ = 440892184320.
The previous prime is 1053242575141. The next prime is 1053242575169. The reversal of 1053242575168 is 8615752423501.
It is a super-2 number, since 2×10532425751682 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053242575169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3770448 + ... + 4040143.
Almost surely, 21053242575168 is an apocalyptic number.
It is an amenable number.
1053242575168 is an abundant number, since it is smaller than the sum of its proper divisors (1434555946304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053242575168 is an equidigital number, since it uses as much as digits as its factorization.
1053242575168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7810660 (or 7810643 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 49.
Adding to 1053242575168 its reverse (8615752423501), we get a palindrome (9668994998669).
The spelling of 1053242575168 in words is "one trillion, fifty-three billion, two hundred forty-two million, five hundred seventy-five thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •