Base | Representation |
---|---|
bin | 100100101010000… |
… | …1101000010000101 |
3 | 10011201112011002212 |
4 | 1021110031002011 |
5 | 10004342024104 |
6 | 322015513205 |
7 | 42324052061 |
oct | 11124150205 |
9 | 3151464085 |
10 | 1230033029 |
11 | 58135a025 |
12 | 2a3b28805 |
13 | 167aab4c4 |
14 | b950aaa1 |
15 | 72ebe36e |
hex | 4950d085 |
1230033029 has 2 divisors, whose sum is σ = 1230033030. Its totient is φ = 1230033028.
The previous prime is 1230032987. The next prime is 1230033043. The reversal of 1230033029 is 9203300321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1226610529 + 3422500 = 35023^2 + 1850^2 .
It is an emirp because it is prime and its reverse (9203300321) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1230033029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1230032995 and 1230033013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1230033529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615016514 + 615016515.
It is an arithmetic number, because the mean of its divisors is an integer number (615016515).
Almost surely, 21230033029 is an apocalyptic number.
It is an amenable number.
1230033029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1230033029 is an equidigital number, since it uses as much as digits as its factorization.
1230033029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 1230033029 is about 35071.8267131896. The cubic root of 1230033029 is about 1071.4508600206.
The spelling of 1230033029 in words is "one billion, two hundred thirty million, thirty-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •