Base | Representation |
---|---|
bin | 100000001010011010111… |
… | …010111001111011010111 |
3 | 21211021221111102022000211 |
4 | 200022122322321323113 |
5 | 242203003323314111 |
6 | 4411205120350251 |
7 | 315453056524426 |
oct | 40123272717327 |
9 | 7737844368024 |
10 | 2210212323031 |
11 | 782389266479 |
12 | 2b842b775387 |
13 | 13056455102b |
14 | 78d90da32bd |
15 | 3c75cca0521 |
hex | 2029aeb9ed7 |
2210212323031 has 6 divisors (see below), whose sum is σ = 2218648195400. Its totient is φ = 2201808404988.
The previous prime is 2210212323023. The next prime is 2210212323043. The reversal of 2210212323031 is 1303232120122.
It is not a de Polignac number, because 2210212323031 - 23 = 2210212323023 is a prime.
It is a super-2 number, since 2×22102123230312 (a number of 25 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 = 2210212322993 and 2210212323011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2210212323061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15907731 + ... + 16046068.
Almost surely, 22210212323031 is an apocalyptic number.
2210212323031 is a deficient number, since it is larger than the sum of its proper divisors (8435872369).
2210212323031 is an frugal number, since it uses more digits than its factorization.
2210212323031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31954325 (or 31954062 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2210212323031 its reverse (1303232120122), we get a palindrome (3513444443153).
The spelling of 2210212323031 in words is "two trillion, two hundred ten billion, two hundred twelve million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •