Base | Representation |
---|---|
bin | 1100010010000111110… |
… | …0111001110011010111 |
3 | 202011200120000122221020 |
4 | 3010201330321303113 |
5 | 11424133342323111 |
6 | 240535335252223 |
7 | 21150226666260 |
oct | 3044174716327 |
9 | 664616018836 |
10 | 211023011031 |
11 | 81548a96578 |
12 | 34a9321a073 |
13 | 16b8cc42601 |
14 | a2dc061967 |
15 | 575105b906 |
hex | 3121f39cd7 |
211023011031 has 16 divisors (see below), whose sum is σ = 323716992000. Its totient is φ = 119775283488.
The previous prime is 211023011021. The next prime is 211023011033. The reversal of 211023011031 is 130110320112.
It is a happy number.
It is not a de Polignac number, because 211023011031 - 25 = 211023010999 is a prime.
It is a super-2 number, since 2×2110230110312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211023011031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211023011033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33717391 + ... + 33723648.
It is an arithmetic number, because the mean of its divisors is an integer number (20232312000).
Almost surely, 2211023011031 is an apocalyptic number.
211023011031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211023011031 is a deficient number, since it is larger than the sum of its proper divisors (112693980969).
211023011031 is a wasteful number, since it uses less digits than its factorization.
211023011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67441198.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 211023011031 its reverse (130110320112), we get a palindrome (341133331143).
The spelling of 211023011031 in words is "two hundred eleven billion, twenty-three million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •