Base | Representation |
---|---|
bin | 11111000000110110000… |
… | …010001110000010111111 |
3 | 21112202000201020020122011 |
4 | 133000312002032002333 |
5 | 234404204321032203 |
6 | 4311021533432051 |
7 | 306655243624135 |
oct | 37006602160277 |
9 | 7482021206564 |
10 | 2131210330303 |
11 | 751928741a9a |
12 | 2a506203b627 |
13 | 125c84109382 |
14 | 752189b7755 |
15 | 3a68721c76d |
hex | 1f03608e0bf |
2131210330303 has 4 divisors (see below), whose sum is σ = 2131457493088. Its totient is φ = 2130963167520.
The previous prime is 2131210330297. The next prime is 2131210330309. The reversal of 2131210330303 is 3030330121312.
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 (2131210330297) and next prime (2131210330309).
It is a cyclic number.
It is not a de Polignac number, because 2131210330303 - 221 = 2131208233151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131210330309) 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, 123568458 + ... + 123585703.
It is an arithmetic number, because the mean of its divisors is an integer number (532864373272).
Almost surely, 22131210330303 is an apocalyptic number.
2131210330303 is a deficient number, since it is larger than the sum of its proper divisors (247162785).
2131210330303 is an equidigital number, since it uses as much as digits as its factorization.
2131210330303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247162784.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2131210330303 its reverse (3030330121312), we get a palindrome (5161540451615).
The spelling of 2131210330303 in words is "two trillion, one hundred thirty-one billion, two hundred ten million, three hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •