Base | Representation |
---|---|
bin | 11110100111100100001… |
… | …11110100001001110001 |
3 | 10201120111001212101100110 |
4 | 33103302013310021301 |
5 | 114214031220430441 |
6 | 2123144155011533 |
7 | 136002246526125 |
oct | 17236207641161 |
9 | 3646431771313 |
10 | 1052034155121 |
11 | 37618a943884 |
12 | 14ba84139ba9 |
13 | 7828b5b0c41 |
14 | 38cc0da3585 |
15 | 1c5749b8b16 |
hex | f4f21f4271 |
1052034155121 has 4 divisors (see below), whose sum is σ = 1402712206832. Its totient is φ = 701356103412.
The previous prime is 1052034155113. The next prime is 1052034155131. The reversal of 1052034155121 is 1215514302501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1052034155121 - 23 = 1052034155113 is a prime.
It is a super-2 number, since 2×10520341551212 (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 (1052034155101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175339025851 + ... + 175339025856.
It is an arithmetic number, because the mean of its divisors is an integer number (350678051708).
Almost surely, 21052034155121 is an apocalyptic number.
It is an amenable number.
1052034155121 is a deficient number, since it is larger than the sum of its proper divisors (350678051711).
1052034155121 is an equidigital number, since it uses as much as digits as its factorization.
1052034155121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350678051710.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 1052034155121 its reverse (1215514302501), we get a palindrome (2267548457622).
The spelling of 1052034155121 in words is "one trillion, fifty-two billion, thirty-four million, one hundred fifty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •