Base | Representation |
---|---|
bin | 100000001010010110000… |
… | …101001011011110111111 |
3 | 21211021201211122021112202 |
4 | 200022112011023132333 |
5 | 242202322032132203 |
6 | 4411153100222115 |
7 | 315451052433065 |
oct | 40122605133677 |
9 | 7737654567482 |
10 | 2210131130303 |
11 | 782347450148 |
12 | 2b840853a93b |
13 | 130550793ab5 |
14 | 78d842aa035 |
15 | 3c755ab3388 |
hex | 2029614b7bf |
2210131130303 has 2 divisors, whose sum is σ = 2210131130304. Its totient is φ = 2210131130302.
The previous prime is 2210131130287. The next prime is 2210131130359. The reversal of 2210131130303 is 3030311310122.
2210131130303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2210131130303 - 24 = 2210131130287 is a prime.
It is a super-2 number, since 2×22101311303032 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2210131130203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105065565151 + 1105065565152.
It is an arithmetic number, because the mean of its divisors is an integer number (1105065565152).
Almost surely, 22210131130303 is an apocalyptic number.
2210131130303 is a deficient number, since it is larger than the sum of its proper divisors (1).
2210131130303 is an equidigital number, since it uses as much as digits as its factorization.
2210131130303 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 2210131130303 its reverse (3030311310122), we get a palindrome (5240442440425).
The spelling of 2210131130303 in words is "two trillion, two hundred ten billion, one hundred thirty-one million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •