Base | Representation |
---|---|
bin | 10001100110111011000… |
… | …000100101100011001011 |
3 | 11021200021121022200022122 |
4 | 101212323000211203023 |
5 | 124311111431201441 |
6 | 2323513234441455 |
7 | 153264335242601 |
oct | 21467300454313 |
9 | 4250247280278 |
10 | 1210023303371 |
11 | 427193678293 |
12 | 17661643328b |
13 | 8a14907404c |
14 | 427cb7d5871 |
15 | 2171eb4d34b |
hex | 119bb0258cb |
1210023303371 has 2 divisors, whose sum is σ = 1210023303372. Its totient is φ = 1210023303370.
The previous prime is 1210023303347. The next prime is 1210023303373. The reversal of 1210023303371 is 1733033200121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1210023303371 - 210 = 1210023302347 is a prime.
Together with 1210023303373, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1210023303371.
It is not a weakly prime, because it can be changed into another prime (1210023303373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605011651685 + 605011651686.
It is an arithmetic number, because the mean of its divisors is an integer number (605011651686).
Almost surely, 21210023303371 is an apocalyptic number.
1210023303371 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210023303371 is an equidigital number, since it uses as much as digits as its factorization.
1210023303371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 26.
Adding to 1210023303371 its reverse (1733033200121), we get a palindrome (2943056503492).
The spelling of 1210023303371 in words is "one trillion, two hundred ten billion, twenty-three million, three hundred three thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •