Base | Representation |
---|---|
bin | 11110101000010000000… |
… | …01010101011110011000 |
3 | 10201121102200012020201102 |
4 | 33110020001111132120 |
5 | 114220304244232402 |
6 | 2123244441410532 |
7 | 136014330423620 |
oct | 17241001253630 |
9 | 3647380166642 |
10 | 1052401555352 |
11 | 376359273034 |
12 | 14bb67199a48 |
13 | 7831974a124 |
14 | 38d17abd880 |
15 | 1c596d8d102 |
hex | f508055798 |
1052401555352 has 32 divisors (see below), whose sum is σ = 2255392339200. Its totient is φ = 450980008224.
The previous prime is 1052401555351. The next prime is 1052401555423. The reversal of 1052401555352 is 2535551042501.
It is a super-2 number, since 2×10524015553522 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1052401555351) 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 7 ways as a sum of consecutive naturals, for example, 505652 + ... + 1536387.
It is an arithmetic number, because the mean of its divisors is an integer number (70481010600).
Almost surely, 21052401555352 is an apocalyptic number.
It is an amenable number.
1052401555352 is an abundant number, since it is smaller than the sum of its proper divisors (1202990783848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052401555352 is a wasteful number, since it uses less digits than its factorization.
1052401555352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2051255 (or 2051251 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 38.
Adding to 1052401555352 its reverse (2535551042501), we get a palindrome (3587952597853).
The spelling of 1052401555352 in words is "one trillion, fifty-two billion, four hundred one million, five hundred fifty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •