Base | Representation |
---|---|
bin | 11110100111110010001… |
… | …11100100110111100001 |
3 | 10201120210020201210120020 |
4 | 33103321013210313201 |
5 | 114214301243024100 |
6 | 2123203550504053 |
7 | 136005203316555 |
oct | 17237107446741 |
9 | 3646706653506 |
10 | 1052151533025 |
11 | 37624012460a |
12 | 14bab7505029 |
13 | 782a99ca518 |
14 | 38cd27d9865 |
15 | 1c57ee525a0 |
hex | f4f91e4de1 |
1052151533025 has 48 divisors (see below), whose sum is σ = 1835821041600. Its totient is φ = 530246511360.
The previous prime is 1052151532937. The next prime is 1052151533039. The reversal of 1052151533025 is 5203351512501.
It is a happy number.
It is not a de Polignac number, because 1052151533025 - 28 = 1052151532769 is a prime.
It is a super-3 number, since 3×10521515330253 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 47 ways as a sum of consecutive naturals, for example, 394714 + ... + 1503363.
It is an arithmetic number, because the mean of its divisors is an integer number (38246271700).
Almost surely, 21052151533025 is an apocalyptic number.
1052151533025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1052151533025 is a deficient number, since it is larger than the sum of its proper divisors (783669508575).
1052151533025 is a wasteful number, since it uses less digits than its factorization.
1052151533025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1898498 (or 1898493 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 1052151533025 in words is "one trillion, fifty-two billion, one hundred fifty-one million, five hundred thirty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •