Base | Representation |
---|---|
bin | 1110101101010001111000… |
… | …00010100011001010000101 |
3 | 11020111212122022211010100101 |
4 | 13112220330002203022011 |
5 | 13214343120411241013 |
6 | 152441432151044101 |
7 | 6545432442635446 |
oct | 726507402431205 |
9 | 136455568733311 |
10 | 32342111040133 |
11 | a33a237585944 |
12 | 376414b670631 |
13 | 1507b0403973b |
14 | 7db51ba6b2cd |
15 | 3b145c4458dd |
hex | 1d6a3c0a3285 |
32342111040133 has 2 divisors, whose sum is σ = 32342111040134. Its totient is φ = 32342111040132.
The previous prime is 32342111040131. The next prime is 32342111040143. The reversal of 32342111040133 is 33104011124323.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22809096636769 + 9533014403364 = 4775887^2 + 3087558^2 .
It is a cyclic number.
It is not a de Polignac number, because 32342111040133 - 21 = 32342111040131 is a prime.
Together with 32342111040131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32342111040131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16171055520066 + 16171055520067.
It is an arithmetic number, because the mean of its divisors is an integer number (16171055520067).
Almost surely, 232342111040133 is an apocalyptic number.
It is an amenable number.
32342111040133 is a deficient number, since it is larger than the sum of its proper divisors (1).
32342111040133 is an equidigital number, since it uses as much as digits as its factorization.
32342111040133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 32342111040133 its reverse (33104011124323), we get a palindrome (65446122164456).
The spelling of 32342111040133 in words is "thirty-two trillion, three hundred forty-two billion, one hundred eleven million, forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •