Base | Representation |
---|---|
bin | 11110000101010111011001… |
… | …111001100101000011110001 |
3 | 122100110201112222120020201211 |
4 | 132011113121321211003301 |
5 | 114320232113031200103 |
6 | 1145222233113400121 |
7 | 36604043124613435 |
oct | 3605273171450361 |
9 | 570421488506654 |
10 | 132310123303153 |
11 | 39181454317854 |
12 | 12a0a708709041 |
13 | 58a9a39047b63 |
14 | 2495bb644c9c5 |
15 | 1046a5384c36d |
hex | 7855d9e650f1 |
132310123303153 has 2 divisors, whose sum is σ = 132310123303154. Its totient is φ = 132310123303152.
The previous prime is 132310123303147. The next prime is 132310123303261. The reversal of 132310123303153 is 351303321013231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117676652364769 + 14633470938384 = 10847887^2 + 3825372^2 .
It is a cyclic number.
It is not a de Polignac number, because 132310123303153 - 241 = 130111100047601 is a prime.
It is not a weakly prime, because it can be changed into another prime (132310123303133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66155061651576 + 66155061651577.
It is an arithmetic number, because the mean of its divisors is an integer number (66155061651577).
Almost surely, 2132310123303153 is an apocalyptic number.
It is an amenable number.
132310123303153 is a deficient number, since it is larger than the sum of its proper divisors (1).
132310123303153 is an equidigital number, since it uses as much as digits as its factorization.
132310123303153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 31.
Adding to 132310123303153 its reverse (351303321013231), we get a palindrome (483613444316384).
The spelling of 132310123303153 in words is "one hundred thirty-two trillion, three hundred ten billion, one hundred twenty-three million, three hundred three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •