Base | Representation |
---|---|
bin | 1100010110101010011… |
… | …1000100011001011111 |
3 | 202021211111210221101212 |
4 | 3011222213010121133 |
5 | 11434132424232111 |
6 | 241300323055035 |
7 | 21222361303112 |
oct | 3055247043137 |
9 | 667744727355 |
10 | 212242024031 |
11 | 820140a9034 |
12 | 3517351147b |
13 | 17025662b8b |
14 | a3b5d00579 |
15 | 57c30a098b |
hex | 316a9c465f |
212242024031 has 4 divisors (see below), whose sum is σ = 224726848992. Its totient is φ = 199757199072.
The previous prime is 212242023967. The next prime is 212242024037. The reversal of 212242024031 is 130420242212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212242024031 - 26 = 212242023967 is a prime.
It is a super-2 number, since 2×2122420240312 (a number of 23 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 = 212242023988 and 212242024006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212242024037) 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, 6242412455 + ... + 6242412488.
It is an arithmetic number, because the mean of its divisors is an integer number (56181712248).
Almost surely, 2212242024031 is an apocalyptic number.
212242024031 is a deficient number, since it is larger than the sum of its proper divisors (12484824961).
212242024031 is a wasteful number, since it uses less digits than its factorization.
212242024031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12484824960.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 212242024031 its reverse (130420242212), we get a palindrome (342662266243).
The spelling of 212242024031 in words is "two hundred twelve billion, two hundred forty-two million, twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •