Base | Representation |
---|---|
bin | 100100101010110… |
… | …0111001111100101 |
3 | 10011202012220222012 |
4 | 1021111213033211 |
5 | 10004440340113 |
6 | 322031444005 |
7 | 42330151253 |
oct | 11125471745 |
9 | 3152186865 |
10 | 1230402533 |
11 | 5815916a8 |
12 | 2a4086605 |
13 | 167baa749 |
14 | b95a55d3 |
15 | 73043aa8 |
hex | 495673e5 |
1230402533 has 2 divisors, whose sum is σ = 1230402534. Its totient is φ = 1230402532.
The previous prime is 1230402527. The next prime is 1230402553. The reversal of 1230402533 is 3352040321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1195568929 + 34833604 = 34577^2 + 5902^2 .
It is a cyclic number.
It is not a de Polignac number, because 1230402533 - 226 = 1163293669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1230402499 and 1230402508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1230402553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615201266 + 615201267.
It is an arithmetic number, because the mean of its divisors is an integer number (615201267).
Almost surely, 21230402533 is an apocalyptic number.
It is an amenable number.
1230402533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1230402533 is an equidigital number, since it uses as much as digits as its factorization.
1230402533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 1230402533 is about 35077.0941356322. The cubic root of 1230402533 is about 1071.5581378286.
Adding to 1230402533 its reverse (3352040321), we get a palindrome (4582442854).
The spelling of 1230402533 in words is "one billion, two hundred thirty million, four hundred two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •