Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …1001110001011010000111 |
3 | 1022110001011110011020011122 |
4 | 2101223132221301122013 |
5 | 2303010021334320121 |
6 | 33142554424224155 |
7 | 2052162066650255 |
oct | 221533651613207 |
9 | 38401143136148 |
10 | 10011009291911 |
11 | 320a710838a81 |
12 | 115824a90b05b |
13 | 578059c87334 |
14 | 26876d33b5d5 |
15 | 12562171a5ab |
hex | 91adea71687 |
10011009291911 has 4 divisors (see below), whose sum is σ = 10160427341112. Its totient is φ = 9861591242712.
The previous prime is 10011009291859. The next prime is 10011009291923. The reversal of 10011009291911 is 11919290011001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011009291911 is a prime.
It is a super-2 number, since 2×100110092919112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011009291961) 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 3 ways as a sum of consecutive naturals, for example, 74709024500 + ... + 74709024633.
It is an arithmetic number, because the mean of its divisors is an integer number (2540106835278).
Almost surely, 210011009291911 is an apocalyptic number.
10011009291911 is a deficient number, since it is larger than the sum of its proper divisors (149418049201).
10011009291911 is an equidigital number, since it uses as much as digits as its factorization.
10011009291911 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149418049200.
The product of its (nonzero) digits is 1458, while the sum is 35.
The spelling of 10011009291911 in words is "ten trillion, eleven billion, nine million, two hundred ninety-one thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •