Base | Representation |
---|---|
bin | 11110010100000100111110… |
… | …100111010010100000101011 |
3 | 122111001101010210122011110012 |
4 | 132110010332213102200223 |
5 | 114433313133330300323 |
6 | 1151314514242442135 |
7 | 40040063615520353 |
oct | 3624047647224053 |
9 | 574041123564405 |
10 | 133321130321963 |
11 | 395311a0434901 |
12 | 12b5264096334b |
13 | 595118982797c |
14 | 24ccac4671b63 |
15 | 1062ec658c678 |
hex | 79413e9d282b |
133321130321963 has 2 divisors, whose sum is σ = 133321130321964. Its totient is φ = 133321130321962.
The previous prime is 133321130321879. The next prime is 133321130322031. The reversal of 133321130321963 is 369123031123331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133321130321963 - 216 = 133321130256427 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133321130321963.
It is not a weakly prime, because it can be changed into another prime (133321130621963) 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, 66660565160981 + 66660565160982.
It is an arithmetic number, because the mean of its divisors is an integer number (66660565160982).
Almost surely, 2133321130321963 is an apocalyptic number.
133321130321963 is a deficient number, since it is larger than the sum of its proper divisors (1).
133321130321963 is an equidigital number, since it uses as much as digits as its factorization.
133321130321963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157464, while the sum is 41.
The spelling of 133321130321963 in words is "one hundred thirty-three trillion, three hundred twenty-one billion, one hundred thirty million, three hundred twenty-one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •