Base | Representation |
---|---|
bin | 111101001000001… |
… | …0111100001110111 |
3 | 12021221112020101020 |
4 | 1322100113201313 |
5 | 13200041023111 |
6 | 535310232223 |
7 | 101554104354 |
oct | 17220274167 |
9 | 5257466336 |
10 | 2051111031 |
11 | 962887092 |
12 | 492ab5673 |
13 | 268c31388 |
14 | 1565a162b |
15 | c010b906 |
hex | 7a417877 |
2051111031 has 16 divisors (see below), whose sum is σ = 2786890080. Its totient is φ = 1341486720.
The previous prime is 2051111017. The next prime is 2051111033. The reversal of 2051111031 is 1301111502.
It is not a de Polignac number, because 2051111031 - 26 = 2051110967 is a prime.
It is a super-2 number, since 2×20511110312 = 8414112922979765922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2051111031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2051111033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56781 + ... + 85593.
It is an arithmetic number, because the mean of its divisors is an integer number (174180630).
Almost surely, 22051111031 is an apocalyptic number.
2051111031 is a deficient number, since it is larger than the sum of its proper divisors (735779049).
2051111031 is a wasteful number, since it uses less digits than its factorization.
2051111031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29266.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 2051111031 is about 45289.1933136372. The cubic root of 2051111031 is about 1270.5635440994.
Adding to 2051111031 its reverse (1301111502), we get a palindrome (3352222533).
The spelling of 2051111031 in words is "two billion, fifty-one million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •