Base | Representation |
---|---|
bin | 11110000101101101000000… |
… | …101110001101010100111101 |
3 | 122100112221102211021201211111 |
4 | 132011231000232031110331 |
5 | 114321122121220241333 |
6 | 1145241031152122021 |
7 | 36605524053601063 |
oct | 3605550056152475 |
9 | 570487384251744 |
10 | 132333323212093 |
11 | 3919027a037813 |
12 | 12a13102236311 |
13 | 58abc9565ba23 |
14 | 2496d776d8033 |
15 | 10474604994cd |
hex | 785b40b8d53d |
132333323212093 has 2 divisors, whose sum is σ = 132333323212094. Its totient is φ = 132333323212092.
The previous prime is 132333323212021. The next prime is 132333323212127. The reversal of 132333323212093 is 390212323333231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89483691614724 + 42849631597369 = 9459582^2 + 6545963^2 .
It is a cyclic number.
It is not a de Polignac number, because 132333323212093 - 237 = 132195884258621 is a prime.
It is a super-2 number, since 2×1323333232120932 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132333323212793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66166661606046 + 66166661606047.
It is an arithmetic number, because the mean of its divisors is an integer number (66166661606047).
Almost surely, 2132333323212093 is an apocalyptic number.
It is an amenable number.
132333323212093 is a deficient number, since it is larger than the sum of its proper divisors (1).
132333323212093 is an equidigital number, since it uses as much as digits as its factorization.
132333323212093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 314928, while the sum is 40.
The spelling of 132333323212093 in words is "one hundred thirty-two trillion, three hundred thirty-three billion, three hundred twenty-three million, two hundred twelve thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •