Base | Representation |
---|---|
bin | 11110000110111101110001… |
… | …101101000010010101101011 |
3 | 122100212020021120101012101212 |
4 | 132012331301231002111223 |
5 | 114324032222322200233 |
6 | 1145344532322503335 |
7 | 36615014100144425 |
oct | 3606756155022553 |
9 | 570766246335355 |
10 | 132420044334443 |
11 | 39214030930568 |
12 | 12a27a84b04b4b |
13 | 58b7206085bc8 |
14 | 249b242d57815 |
15 | 1049838a46a48 |
hex | 786f71b4256b |
132420044334443 has 2 divisors, whose sum is σ = 132420044334444. Its totient is φ = 132420044334442.
The previous prime is 132420044334337. The next prime is 132420044334499. The reversal of 132420044334443 is 344433440024231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132420044334443 - 28 = 132420044334187 is a prime.
It is a super-2 number, since 2×1324200443344432 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132420044334443.
It is not a weakly prime, because it can be changed into another prime (132420044384443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66210022167221 + 66210022167222.
It is an arithmetic number, because the mean of its divisors is an integer number (66210022167222).
Almost surely, 2132420044334443 is an apocalyptic number.
132420044334443 is a deficient number, since it is larger than the sum of its proper divisors (1).
132420044334443 is an equidigital number, since it uses as much as digits as its factorization.
132420044334443 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1327104, while the sum is 41.
Adding to 132420044334443 its reverse (344433440024231), we get a palindrome (476853484358674).
The spelling of 132420044334443 in words is "one hundred thirty-two trillion, four hundred twenty billion, forty-four million, three hundred thirty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •