Base | Representation |
---|---|
bin | 11101011001010001111… |
… | …11000011000110101111 |
3 | 10120112222222110120122201 |
4 | 32230220333003012233 |
5 | 113021442230242431 |
6 | 2051553450522331 |
7 | 132653602156030 |
oct | 16545077030657 |
9 | 3515888416581 |
10 | 1010004930991 |
11 | 35a3824a8701 |
12 | 1438b47363a7 |
13 | 74320cc1554 |
14 | 36c550d0a87 |
15 | 1b414c9a461 |
hex | eb28fc31af |
1010004930991 has 8 divisors (see below), whose sum is σ = 1154300872320. Its totient is φ = 865711370328.
The previous prime is 1010004930967. The next prime is 1010004931009. The reversal of 1010004930991 is 1990394000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1010004930991 - 215 = 1010004898223 is a prime.
It is a super-2 number, since 2×10100049309912 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010004930991.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010004930901) 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 7 ways as a sum of consecutive naturals, for example, 432180 + ... + 1485526.
It is an arithmetic number, because the mean of its divisors is an integer number (144287609040).
Almost surely, 21010004930991 is an apocalyptic number.
1010004930991 is a deficient number, since it is larger than the sum of its proper divisors (144295941329).
1010004930991 is a wasteful number, since it uses less digits than its factorization.
1010004930991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1190333.
The product of its (nonzero) digits is 8748, while the sum is 37.
The spelling of 1010004930991 in words is "one trillion, ten billion, four million, nine hundred thirty thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •