Base | Representation |
---|---|
bin | 111101101010100111… |
… | …1001101011011001001 |
3 | 110122211000220220121101 |
4 | 1323111033031123021 |
5 | 4132202144144113 |
6 | 140500320341401 |
7 | 12365440061665 |
oct | 1732517153311 |
9 | 418730826541 |
10 | 132426553033 |
11 | 51186378365 |
12 | 217b9474861 |
13 | c645829528 |
14 | 65a387b8a5 |
15 | 36a0dd22dd |
hex | 1ed53cd6c9 |
132426553033 has 2 divisors, whose sum is σ = 132426553034. Its totient is φ = 132426553032.
The previous prime is 132426553031. The next prime is 132426553081. The reversal of 132426553033 is 330355624231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106963010704 + 25463542329 = 327052^2 + 159573^2 .
It is a cyclic number.
It is not a de Polignac number, because 132426553033 - 21 = 132426553031 is a prime.
It is a super-3 number, since 3×1324265530333 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 132426553031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 132426552983 and 132426553001.
It is not a weakly prime, because it can be changed into another prime (132426553031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66213276516 + 66213276517.
It is an arithmetic number, because the mean of its divisors is an integer number (66213276517).
Almost surely, 2132426553033 is an apocalyptic number.
It is an amenable number.
132426553033 is a deficient number, since it is larger than the sum of its proper divisors (1).
132426553033 is an equidigital number, since it uses as much as digits as its factorization.
132426553033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 37.
The spelling of 132426553033 in words is "one hundred thirty-two billion, four hundred twenty-six million, five hundred fifty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •