Base | Representation |
---|---|
bin | 101000111100… |
… | …011011010101 |
3 | 202012022021111 |
4 | 220330123111 |
5 | 10221431034 |
6 | 1022015021 |
7 | 160142221 |
oct | 50743325 |
9 | 22168244 |
10 | 10733269 |
11 | 6071078 |
12 | 3717471 |
13 | 22ba561 |
14 | 15d5781 |
15 | e20364 |
hex | a3c6d5 |
10733269 has 2 divisors, whose sum is σ = 10733270. Its totient is φ = 10733268.
The previous prime is 10733243. The next prime is 10733279. The reversal of 10733269 is 96233701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5466244 + 5267025 = 2338^2 + 2295^2 .
It is an emirp because it is prime and its reverse (96233701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10733269 - 25 = 10733237 is a prime.
It is a super-2 number, since 2×107332692 = 230406126852722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10733269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10733209) 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, 5366634 + 5366635.
It is an arithmetic number, because the mean of its divisors is an integer number (5366635).
Almost surely, 210733269 is an apocalyptic number.
It is an amenable number.
10733269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10733269 is an equidigital number, since it uses as much as digits as its factorization.
10733269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 31.
The square root of 10733269 is about 3276.1668150447. The cubic root of 10733269 is about 220.5856914349.
The spelling of 10733269 in words is "ten million, seven hundred thirty-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •