Base | Representation |
---|---|
bin | 10011001100000110… |
… | …11001101011000011 |
3 | 222120222020000110011 |
4 | 21212003121223003 |
5 | 132044314232321 |
6 | 4422133445351 |
7 | 513203265262 |
oct | 114603315303 |
9 | 28528200404 |
10 | 10302102211 |
11 | 44072a4965 |
12 | 1bb61a0857 |
13 | c8247308b |
14 | 6da3225d9 |
15 | 404684ae1 |
hex | 2660d9ac3 |
10302102211 has 4 divisors (see below), whose sum is σ = 10496481552. Its totient is φ = 10107722872.
The previous prime is 10302102197. The next prime is 10302102287. The reversal of 10302102211 is 11220120301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11220120301 = 13 ⋅863086177.
It is a cyclic number.
It is not a de Polignac number, because 10302102211 - 29 = 10302101699 is a prime.
It is a super-2 number, since 2×103021022112 (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 = 10302102191 and 10302102200.
It is not an unprimeable number, because it can be changed into a prime (10302102011) 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, 97189591 + ... + 97189696.
It is an arithmetic number, because the mean of its divisors is an integer number (2624120388).
Almost surely, 210302102211 is an apocalyptic number.
10302102211 is a deficient number, since it is larger than the sum of its proper divisors (194379341).
10302102211 is an equidigital number, since it uses as much as digits as its factorization.
10302102211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194379340.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10302102211 its reverse (11220120301), we get a palindrome (21522222512).
The spelling of 10302102211 in words is "ten billion, three hundred two million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •