Base | Representation |
---|---|
bin | 10011001100001000… |
… | …10001010101100001 |
3 | 222120222122121012112 |
4 | 21212010101111201 |
5 | 132044344031314 |
6 | 4422142405105 |
7 | 513205235063 |
oct | 114604212541 |
9 | 28528577175 |
10 | 10302330209 |
11 | 4407440196 |
12 | 1bb6290795 |
13 | c82522aa2 |
14 | 6da381733 |
15 | 4046cc43e |
hex | 266111561 |
10302330209 has 8 divisors (see below), whose sum is σ = 10614587880. Its totient is φ = 9991852416.
The previous prime is 10302330173. The next prime is 10302330211. The reversal of 10302330209 is 90203320301.
It can be written as a sum of positive squares in 4 ways, for example, as 378185809 + 9924144400 = 19447^2 + 99620^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10302330209 - 228 = 10033894753 is a prime.
It is a super-2 number, since 2×103023302092 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10302330229) 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 in 7 ways as a sum of consecutive naturals, for example, 433214 + ... + 456375.
It is an arithmetic number, because the mean of its divisors is an integer number (1326823485).
Almost surely, 210302330209 is an apocalyptic number.
It is an amenable number.
10302330209 is a deficient number, since it is larger than the sum of its proper divisors (312257671).
10302330209 is an equidigital number, since it uses as much as digits as its factorization.
10302330209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 889939.
The product of its (nonzero) digits is 972, while the sum is 23.
The spelling of 10302330209 in words is "ten billion, three hundred two million, three hundred thirty thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •