Base | Representation |
---|---|
bin | 11110000001011010100… |
… | …11000110100010111001 |
3 | 10122121121122022212110212 |
4 | 33000231103012202321 |
5 | 113400104321231210 |
6 | 2105515530120505 |
7 | 134345552313611 |
oct | 17005523064271 |
9 | 3577548285425 |
10 | 1031552133305 |
11 | 36852a317721 |
12 | 147b08880135 |
13 | 763760a72c5 |
14 | 37cdaa85a41 |
15 | 1bc76786805 |
hex | f02d4c68b9 |
1031552133305 has 4 divisors (see below), whose sum is σ = 1237862559972. Its totient is φ = 825241706640.
The previous prime is 1031552133281. The next prime is 1031552133323. The reversal of 1031552133305 is 5033312551301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 209730109369 + 821822023936 = 457963^2 + 906544^2 .
It is a de Polignac number, because none of the positive numbers 2k-1031552133305 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103155213326 + ... + 103155213335.
It is an arithmetic number, because the mean of its divisors is an integer number (309465639993).
Almost surely, 21031552133305 is an apocalyptic number.
It is an amenable number.
1031552133305 is a deficient number, since it is larger than the sum of its proper divisors (206310426667).
1031552133305 is an equidigital number, since it uses as much as digits as its factorization.
1031552133305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206310426666.
The product of its (nonzero) digits is 20250, while the sum is 32.
Adding to 1031552133305 its reverse (5033312551301), we get a palindrome (6064864684606).
The spelling of 1031552133305 in words is "one trillion, thirty-one billion, five hundred fifty-two million, one hundred thirty-three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •