Base | Representation |
---|---|
bin | 11110001111111000000000… |
… | …010111101010101000010111 |
3 | 122110000202200100010210100011 |
4 | 132033320000113222220113 |
5 | 114414100144221331411 |
6 | 1150534112224301051 |
7 | 40010160661660435 |
oct | 3617700027525027 |
9 | 573022610123304 |
10 | 133032323230231 |
11 | 3942a767355217 |
12 | 12b0667ba71787 |
13 | 592cb81896b09 |
14 | 24bcb27c97d55 |
15 | 105a721875c21 |
hex | 78fe005eaa17 |
133032323230231 has 2 divisors, whose sum is σ = 133032323230232. Its totient is φ = 133032323230230.
The previous prime is 133032323230223. The next prime is 133032323230237. The reversal of 133032323230231 is 132032323230331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133032323230231 - 23 = 133032323230223 is a prime.
It is a super-2 number, since 2×1330323232302312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133032323230193 and 133032323230202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133032323230237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66516161615115 + 66516161615116.
It is an arithmetic number, because the mean of its divisors is an integer number (66516161615116).
Almost surely, 2133032323230231 is an apocalyptic number.
133032323230231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133032323230231 is an equidigital number, since it uses as much as digits as its factorization.
133032323230231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 133032323230231 its reverse (132032323230331), we get a palindrome (265064646460562).
The spelling of 133032323230231 in words is "one hundred thirty-three trillion, thirty-two billion, three hundred twenty-three million, two hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •