Base | Representation |
---|---|
bin | 111101111100100110… |
… | …1001100011000000111 |
3 | 110201101002102102000202 |
4 | 1323321031030120013 |
5 | 4134421140113411 |
6 | 141040234401115 |
7 | 12416415243635 |
oct | 1737115143007 |
9 | 421332372022 |
10 | 133030004231 |
11 | 51465a73163 |
12 | 2194759019b |
13 | c710862c47 |
14 | 661da82355 |
15 | 36d8d8283b |
hex | 1ef934c607 |
133030004231 has 2 divisors, whose sum is σ = 133030004232. Its totient is φ = 133030004230.
The previous prime is 133030004213. The next prime is 133030004251. The reversal of 133030004231 is 132400030331.
Together with previous prime (133030004213) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (133030004251) can be obtained adding 133030004231 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133030004231 is a prime.
It is a super-2 number, since 2×1330300042312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133030004251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515002115 + 66515002116.
It is an arithmetic number, because the mean of its divisors is an integer number (66515002116).
Almost surely, 2133030004231 is an apocalyptic number.
133030004231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133030004231 is an equidigital number, since it uses as much as digits as its factorization.
133030004231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 133030004231 its reverse (132400030331), we get a palindrome (265430034562).
The spelling of 133030004231 in words is "one hundred thirty-three billion, thirty million, four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •