Base | Representation |
---|---|
bin | 10011010000101000… |
… | …00110001011110101 |
3 | 222200121121010002011 |
4 | 21220110012023311 |
5 | 132134022031034 |
6 | 4430010444221 |
7 | 514143555406 |
oct | 115024061365 |
9 | 28617533064 |
10 | 10340033269 |
11 | 4426752045 |
12 | 2006a33671 |
13 | c8a293ca7 |
14 | 7013979ad |
15 | 407b78864 |
hex | 2685062f5 |
10340033269 has 2 divisors, whose sum is σ = 10340033270. Its totient is φ = 10340033268.
The previous prime is 10340033183. The next prime is 10340033279. The reversal of 10340033269 is 96233004301.
10340033269 is digitally balanced in base 3, 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., 10294740369 + 45292900 = 101463^2 + 6730^2 .
It is a cyclic number.
It is not a de Polignac number, because 10340033269 - 213 = 10340025077 is a prime.
It is a super-2 number, since 2×103400332692 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10340033269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10340033279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5170016634 + 5170016635.
It is an arithmetic number, because the mean of its divisors is an integer number (5170016635).
Almost surely, 210340033269 is an apocalyptic number.
It is an amenable number.
10340033269 is a deficient number, since it is larger than the sum of its proper divisors (1).
10340033269 is an equidigital number, since it uses as much as digits as its factorization.
10340033269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The spelling of 10340033269 in words is "ten billion, three hundred forty million, thirty-three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •