Base | Representation |
---|---|
bin | 111100001001011… |
… | …101110101000001 |
3 | 2121022211022202122 |
4 | 330021131311001 |
5 | 4031313130213 |
6 | 244044454025 |
7 | 34002221405 |
oct | 7411356501 |
9 | 2538738678 |
10 | 1009114433 |
11 | 478689678 |
12 | 241b4a315 |
13 | 1310ab942 |
14 | 98041105 |
15 | 5d8d1d08 |
hex | 3c25dd41 |
1009114433 has 2 divisors, whose sum is σ = 1009114434. Its totient is φ = 1009114432.
The previous prime is 1009114417. The next prime is 1009114439. The reversal of 1009114433 is 3344119001.
1009114433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 959946289 + 49168144 = 30983^2 + 7012^2 .
It is an emirp because it is prime and its reverse (3344119001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1009114433 - 24 = 1009114417 is a prime.
It is a super-2 number, since 2×10091144332 = 2036623877777822978, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1009114439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 504557216 + 504557217.
It is an arithmetic number, because the mean of its divisors is an integer number (504557217).
Almost surely, 21009114433 is an apocalyptic number.
It is an amenable number.
1009114433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1009114433 is an equidigital number, since it uses as much as digits as its factorization.
1009114433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 1009114433 is about 31766.5615545655. The cubic root of 1009114433 is about 1003.0289604686.
The spelling of 1009114433 in words is "one billion, nine million, one hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •