Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0011001011111010111 |
3 | 202021021010011000012100 |
4 | 3011131130121133113 |
5 | 11433204401414111 |
6 | 241222352253143 |
7 | 21214036544634 |
oct | 3053534313727 |
9 | 667233130170 |
10 | 212021123031 |
11 | 81a1043a923 |
12 | 351115411b3 |
13 | 16cbb96b323 |
14 | a39483b18b |
15 | 57ad9b8756 |
hex | 315d7197d7 |
212021123031 has 24 divisors (see below), whose sum is σ = 319644745056. Its totient is φ = 135169436160.
The previous prime is 212021123029. The next prime is 212021123059. The reversal of 212021123031 is 130321120212.
It is not a de Polignac number, because 212021123031 - 21 = 212021123029 is a prime.
It is a super-2 number, since 2×2120211230312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212021122995 and 212021123013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212021123231) 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 23 ways as a sum of consecutive naturals, for example, 757131 + ... + 998643.
It is an arithmetic number, because the mean of its divisors is an integer number (13318531044).
Almost surely, 2212021123031 is an apocalyptic number.
212021123031 is a deficient number, since it is larger than the sum of its proper divisors (107623622025).
212021123031 is a wasteful number, since it uses less digits than its factorization.
212021123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245783 (or 245780 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 212021123031 its reverse (130321120212), we get a palindrome (342342243243).
The spelling of 212021123031 in words is "two hundred twelve billion, twenty-one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •