Base | Representation |
---|---|
bin | 10011000001001000… |
… | …11110101011111010 |
3 | 222100120010100010201 |
4 | 21200210132223322 |
5 | 131402242011302 |
6 | 4405050032414 |
7 | 511005335065 |
oct | 114044365372 |
9 | 28316110121 |
10 | 10210110202 |
11 | 436a382a06 |
12 | 1b8b41870a |
13 | c693a4536 |
14 | 6cc0178dc |
15 | 3eb562c87 |
hex | 26091eafa |
10210110202 has 4 divisors (see below), whose sum is σ = 15315165306. Its totient is φ = 5105055100.
The previous prime is 10210110187. The next prime is 10210110203. The reversal of 10210110202 is 20201101201.
10210110202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 20201101201 = 2543 ⋅7943807.
It can be written as a sum of positive squares in only one way, i.e., 9333298881 + 876811321 = 96609^2 + 29611^2 .
It is not an unprimeable number, because it can be changed into a prime (10210110203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552527549 + ... + 2552527552.
Almost surely, 210210110202 is an apocalyptic number.
10210110202 is a deficient number, since it is larger than the sum of its proper divisors (5105055104).
10210110202 is an equidigital number, since it uses as much as digits as its factorization.
10210110202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5105055103.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10210110202 its reverse (20201101201), we get a palindrome (30411211403).
Subtracting 10210110202 from its reverse (20201101201), we obtain a palindrome (9990990999).
The spelling of 10210110202 in words is "ten billion, two hundred ten million, one hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •