Base | Representation |
---|---|
bin | 111011111101011… |
… | …0000001111000111 |
3 | 12012012201122002211 |
4 | 1313322300033013 |
5 | 13110021000011 |
6 | 531345444251 |
7 | 100566534232 |
oct | 16772601707 |
9 | 5165648084 |
10 | 2011890631 |
11 | 942729233 |
12 | 481940687 |
13 | 260a7b63a |
14 | 1512b2419 |
15 | bb960b21 |
hex | 77eb03c7 |
2011890631 has 8 divisors (see below), whose sum is σ = 2082564720. Its totient is φ = 1941303168.
The previous prime is 2011890599. The next prime is 2011890659. The reversal of 2011890631 is 1360981102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011890631 - 25 = 2011890599 is a prime.
It is a super-2 number, since 2×20118906312 = 8095407822211156322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011890593 and 2011890602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011890691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27535 + ... + 69151.
It is an arithmetic number, because the mean of its divisors is an integer number (260320590).
Almost surely, 22011890631 is an apocalyptic number.
2011890631 is a deficient number, since it is larger than the sum of its proper divisors (70674089).
2011890631 is a wasteful number, since it uses less digits than its factorization.
2011890631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43313.
The product of its (nonzero) digits is 2592, while the sum is 31.
The square root of 2011890631 is about 44854.1038367728. The cubic root of 2011890631 is about 1262.4129939845.
The spelling of 2011890631 in words is "two billion, eleven million, eight hundred ninety thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •