Base | Representation |
---|---|
bin | 11110100111111001011… |
… | …00100010101011100011 |
3 | 10201120221102200020021221 |
4 | 33103330230202223203 |
5 | 114214412124230133 |
6 | 2123213533155511 |
7 | 136006532435065 |
oct | 17237454425343 |
9 | 3646842606257 |
10 | 1052211555043 |
11 | 376270a9aa90 |
12 | 14bb1362bb97 |
13 | 782b92844cc |
14 | 38cda781735 |
15 | 1c58535ba2d |
hex | f4fcb22ae3 |
1052211555043 has 8 divisors (see below), whose sum is σ = 1147874672880. Its totient is φ = 956549690880.
The previous prime is 1052211555029. The next prime is 1052211555053. The reversal of 1052211555043 is 3405551122501.
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 1052211555043 - 233 = 1043621620451 is a prime.
It is a super-2 number, since 2×10522115550432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1052211555053) 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, 2707603 + ... + 3071731.
It is an arithmetic number, because the mean of its divisors is an integer number (143484334110).
Almost surely, 21052211555043 is an apocalyptic number.
1052211555043 is a deficient number, since it is larger than the sum of its proper divisors (95663117837).
1052211555043 is a wasteful number, since it uses less digits than its factorization.
1052211555043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626837.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 1052211555043 its reverse (3405551122501), we get a palindrome (4457762677544).
The spelling of 1052211555043 in words is "one trillion, fifty-two billion, two hundred eleven million, five hundred fifty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •