Base | Representation |
---|---|
bin | 11110000100011001010000… |
… | …111000110001010011011011 |
3 | 122100020100022221002111101101 |
4 | 132010121100320301103123 |
5 | 114313133440411300011 |
6 | 1145131440155532231 |
7 | 36566161510021462 |
oct | 3604312070612333 |
9 | 570210287074341 |
10 | 132243400103131 |
11 | 39156124864039 |
12 | 129b97a715a077 |
13 | 58a366474ba05 |
14 | 2492886ad39d9 |
15 | 1044e4ac5a2c1 |
hex | 784650e314db |
132243400103131 has 2 divisors, whose sum is σ = 132243400103132. Its totient is φ = 132243400103130.
The previous prime is 132243400103063. The next prime is 132243400103147. The reversal of 132243400103131 is 131301004342231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132243400103131 - 227 = 132243265885403 is a prime.
It is a super-2 number, since 2×1322434001031312 (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 132243400103131.
It is not a weakly prime, because it can be changed into another prime (132243400103161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66121700051565 + 66121700051566.
It is an arithmetic number, because the mean of its divisors is an integer number (66121700051566).
Almost surely, 2132243400103131 is an apocalyptic number.
132243400103131 is a deficient number, since it is larger than the sum of its proper divisors (1).
132243400103131 is an equidigital number, since it uses as much as digits as its factorization.
132243400103131 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 132243400103131 its reverse (131301004342231), we get a palindrome (263544404445362).
The spelling of 132243400103131 in words is "one hundred thirty-two trillion, two hundred forty-three billion, four hundred million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •