Base | Representation |
---|---|
bin | 100100110000100… |
… | …1010011000001111 |
3 | 10011221220201220202 |
4 | 1021201022120033 |
5 | 10011224230111 |
6 | 322220404115 |
7 | 42364660631 |
oct | 11141123017 |
9 | 3157821822 |
10 | 1233430031 |
11 | 58326a269 |
12 | 2a50a663b |
13 | 1686ca772 |
14 | b9b52a51 |
15 | 73440b3b |
hex | 4984a60f |
1233430031 has 2 divisors, whose sum is σ = 1233430032. Its totient is φ = 1233430030.
The previous prime is 1233430021. The next prime is 1233430057. The reversal of 1233430031 is 1300343321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1233430031 - 210 = 1233429007 is a prime.
It is a super-2 number, since 2×12334300312 = 3042699282745321922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1233429985 and 1233430012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1233430021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616715015 + 616715016.
It is an arithmetic number, because the mean of its divisors is an integer number (616715016).
Almost surely, 21233430031 is an apocalyptic number.
1233430031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1233430031 is an equidigital number, since it uses as much as digits as its factorization.
1233430031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 1233430031 is about 35120.2225363109. Note that the first 3 decimals coincide. The cubic root of 1233430031 is about 1072.4363010982.
Adding to 1233430031 its reverse (1300343321), we get a palindrome (2533773352).
The spelling of 1233430031 in words is "one billion, two hundred thirty-three million, four hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •