Base | Representation |
---|---|
bin | 10011010111111001100… |
… | …100100101010011110101 |
3 | 11201021101211001112112101 |
4 | 103113321210211103311 |
5 | 133303031443330003 |
6 | 2455334441222101 |
7 | 165120435244066 |
oct | 23277144452365 |
9 | 4637354045471 |
10 | 1331332011253 |
11 | 473684237a72 |
12 | 196030491931 |
13 | 9870c424a7a |
14 | 4861888856d |
15 | 2496e96411d |
hex | 135f99254f5 |
1331332011253 has 2 divisors, whose sum is σ = 1331332011254. Its totient is φ = 1331332011252.
The previous prime is 1331332011173. The next prime is 1331332011301. The reversal of 1331332011253 is 3521102331331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 882139843729 + 449192167524 = 939223^2 + 670218^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331332011253 - 233 = 1322742076661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331332041253) 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 as a sum of consecutive naturals, namely, 665666005626 + 665666005627.
It is an arithmetic number, because the mean of its divisors is an integer number (665666005627).
Almost surely, 21331332011253 is an apocalyptic number.
It is an amenable number.
1331332011253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331332011253 is an equidigital number, since it uses as much as digits as its factorization.
1331332011253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 1331332011253 its reverse (3521102331331), we get a palindrome (4852434342584).
The spelling of 1331332011253 in words is "one trillion, three hundred thirty-one billion, three hundred thirty-two million, eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •