Base | Representation |
---|---|
bin | 10011001100001000… |
… | …10010000110110001 |
3 | 222120222122202112021 |
4 | 21212010102012301 |
5 | 132044344131421 |
6 | 4422142431441 |
7 | 513205250215 |
oct | 114604220661 |
9 | 28528582467 |
10 | 10302333361 |
11 | 44074425a1 |
12 | 1bb6292581 |
13 | c82524358 |
14 | 6da382945 |
15 | 4046cd341 |
hex | 2661121b1 |
10302333361 has 2 divisors, whose sum is σ = 10302333362. Its totient is φ = 10302333360.
The previous prime is 10302333313. The next prime is 10302333367. The reversal of 10302333361 is 16333320301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9150070336 + 1152263025 = 95656^2 + 33945^2 .
It is an emirp because it is prime and its reverse (16333320301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10302333361 - 221 = 10300236209 is a prime.
It is a super-2 number, since 2×103023333612 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302333367) 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, 5151166680 + 5151166681.
It is an arithmetic number, because the mean of its divisors is an integer number (5151166681).
Almost surely, 210302333361 is an apocalyptic number.
It is an amenable number.
10302333361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302333361 is an equidigital number, since it uses as much as digits as its factorization.
10302333361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 10302333361 its reverse (16333320301), we get a palindrome (26635653662).
The spelling of 10302333361 in words is "ten billion, three hundred two million, three hundred thirty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •