Base | Representation |
---|---|
bin | 11110010010110000011001… |
… | …000010101000011101010011 |
3 | 122110201200201001222101112111 |
4 | 132102300121002220131103 |
5 | 114430321131221023243 |
6 | 1151205054002410151 |
7 | 40030400113501111 |
oct | 3622603102503523 |
9 | 573650631871474 |
10 | 133230305642323 |
11 | 394a672325679a |
12 | 12b38b13960957 |
13 | 5945743bc1396 |
14 | 24c854a022ab1 |
15 | 106095cb1139d |
hex | 792c190a8753 |
133230305642323 has 2 divisors, whose sum is σ = 133230305642324. Its totient is φ = 133230305642322.
The previous prime is 133230305642321. The next prime is 133230305642363. The reversal of 133230305642323 is 323246503032331.
It is an a-pointer prime, because the next prime (133230305642363) can be obtained adding 133230305642323 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133230305642323 - 21 = 133230305642321 is a prime.
Together with 133230305642321, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (133230305642321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66615152821161 + 66615152821162.
It is an arithmetic number, because the mean of its divisors is an integer number (66615152821162).
Almost surely, 2133230305642323 is an apocalyptic number.
133230305642323 is a deficient number, since it is larger than the sum of its proper divisors (1).
133230305642323 is an equidigital number, since it uses as much as digits as its factorization.
133230305642323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 40.
Adding to 133230305642323 its reverse (323246503032331), we get a palindrome (456476808674654).
The spelling of 133230305642323 in words is "one hundred thirty-three trillion, two hundred thirty billion, three hundred five million, six hundred forty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •