Base | Representation |
---|---|
bin | 10011001100000111… |
… | …11000110111111011 |
3 | 222120222110111202111 |
4 | 21212003320313323 |
5 | 132044332330021 |
6 | 4422140313151 |
7 | 513204340003 |
oct | 114603706773 |
9 | 28528414674 |
10 | 10302230011 |
11 | 4407381987 |
12 | 1bb62427b7 |
13 | c824b92b8 |
14 | 6da357003 |
15 | 4046ac8e1 |
hex | 2660f8dfb |
10302230011 has 4 divisors (see below), whose sum is σ = 10305887400. Its totient is φ = 10298572624.
The previous prime is 10302229981. The next prime is 10302230041. The reversal of 10302230011 is 11003220301.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10302229981) and next prime (10302230041).
It is a cyclic number.
It is not a de Polignac number, because 10302230011 - 25 = 10302229979 is a prime.
It is a super-2 number, since 2×103022300112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10302229973 and 10302230000.
It is not an unprimeable number, because it can be changed into a prime (10302230041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1824466 + ... + 1830103.
It is an arithmetic number, because the mean of its divisors is an integer number (2576471850).
Almost surely, 210302230011 is an apocalyptic number.
10302230011 is a deficient number, since it is larger than the sum of its proper divisors (3657389).
10302230011 is an equidigital number, since it uses as much as digits as its factorization.
10302230011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3657388.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 10302230011 its reverse (11003220301), we get a palindrome (21305450312).
The spelling of 10302230011 in words is "ten billion, three hundred two million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •