Base | Representation |
---|---|
bin | 11110100111110010110… |
… | …11000010100111101001 |
3 | 10201120210121100001000102 |
4 | 33103321123002213221 |
5 | 114214304044320000 |
6 | 2123204252115145 |
7 | 136005264561134 |
oct | 17237133024751 |
9 | 3646717301012 |
10 | 1052156635625 |
11 | 376242a9a237 |
12 | 14bab9165ab5 |
13 | 782aaa95c04 |
14 | 38cd336721b |
15 | 1c58060e3d5 |
hex | f4f96c29e9 |
1052156635625 has 20 divisors (see below), whose sum is σ = 1328329389156. Its totient is φ = 833047680000.
The previous prime is 1052156635591. The next prime is 1052156635637. The reversal of 1052156635625 is 5265366512501.
It can be written as a sum of positive squares in 10 ways, for example, as 993536478169 + 58620157456 = 996763^2 + 242116^2 .
It is not a de Polignac number, because 1052156635625 - 222 = 1052152441321 is a prime.
It is a super-2 number, since 2×10521566356252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1052156635625.
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 19 ways as a sum of consecutive naturals, for example, 8616956 + ... + 8738205.
Almost surely, 21052156635625 is an apocalyptic number.
It is an amenable number.
1052156635625 is a deficient number, since it is larger than the sum of its proper divisors (276172753531).
1052156635625 is an frugal number, since it uses more digits than its factorization.
1052156635625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17355278 (or 17355263 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 47.
The spelling of 1052156635625 in words is "one trillion, fifty-two billion, one hundred fifty-six million, six hundred thirty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •