Base | Representation |
---|---|
bin | 11110100111100011101… |
… | …01000100101111110001 |
3 | 10201120110201121210022002 |
4 | 33103301311010233301 |
5 | 114214023441223403 |
6 | 2123143501423345 |
7 | 136002160005155 |
oct | 17236165045761 |
9 | 3646421553262 |
10 | 1052029242353 |
11 | 376188098841 |
12 | 14ba8256ab55 |
13 | 7828a580a8b |
14 | 38cc0485065 |
15 | 1c574348188 |
hex | f4f1d44bf1 |
1052029242353 has 8 divisors (see below), whose sum is σ = 1058669493888. Its totient is φ = 1045391260464.
The previous prime is 1052029242349. The next prime is 1052029242361. The reversal of 1052029242353 is 3532429202501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052029242353 - 22 = 1052029242349 is a prime.
It is a super-3 number, since 3×10520292423533 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1052029242373) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 367400 + ... + 1496342.
It is an arithmetic number, because the mean of its divisors is an integer number (132333686736).
Almost surely, 21052029242353 is an apocalyptic number.
It is an amenable number.
1052029242353 is a deficient number, since it is larger than the sum of its proper divisors (6640251535).
1052029242353 is a wasteful number, since it uses less digits than its factorization.
1052029242353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134823.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 1052029242353 in words is "one trillion, fifty-two billion, twenty-nine million, two hundred forty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •