Base | Representation |
---|---|
bin | 10011011000101001001… |
… | …000110000000100000001 |
3 | 11201100110102122122222101 |
4 | 103120221020300010001 |
5 | 133311200241143013 |
6 | 2455545545310401 |
7 | 165146265233005 |
oct | 23305110600401 |
9 | 4640412578871 |
10 | 1332130021633 |
11 | 473a53739a84 |
12 | 196213795401 |
13 | 9880885c168 |
14 | 48692856705 |
15 | 249b9a468dd |
hex | 13629230101 |
1332130021633 has 2 divisors, whose sum is σ = 1332130021634. Its totient is φ = 1332130021632.
The previous prime is 1332130021631. The next prime is 1332130021693. The reversal of 1332130021633 is 3361200312331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1287301275649 + 44828745984 = 1134593^2 + 211728^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332130021633 - 21 = 1332130021631 is a prime.
Together with 1332130021631, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1332130021631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 666065010816 + 666065010817.
It is an arithmetic number, because the mean of its divisors is an integer number (666065010817).
Almost surely, 21332130021633 is an apocalyptic number.
It is an amenable number.
1332130021633 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332130021633 is an equidigital number, since it uses as much as digits as its factorization.
1332130021633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 1332130021633 its reverse (3361200312331), we get a palindrome (4693330333964).
The spelling of 1332130021633 in words is "one trillion, three hundred thirty-two billion, one hundred thirty million, twenty-one thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •