Base | Representation |
---|---|
bin | 1001000110101101111011… |
… | …0001000101101100100011 |
3 | 1022110001011120202200022200 |
4 | 2101223132301011230203 |
5 | 2303010022332210034 |
6 | 33142554533304243 |
7 | 2052162122156361 |
oct | 221533661055443 |
9 | 38401146680280 |
10 | 10011011210019 |
11 | 320a711929096 |
12 | 115824b495083 |
13 | 57805a4a9401 |
14 | 26876d6ba631 |
15 | 125621998a99 |
hex | 91adec45b23 |
10011011210019 has 12 divisors (see below), whose sum is σ = 14540240961792. Its totient is φ = 6637134502800.
The previous prime is 10011011210003. The next prime is 10011011210023. The reversal of 10011011210019 is 91001211011001.
10011011210019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10011011210019 - 24 = 10011011210003 is a prime.
It is a super-2 number, since 2×100110112100192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10011011209983 and 10011011210010.
It is not an unprimeable number, because it can be changed into a prime (10011011210029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3072745827 + ... + 3072749084.
It is an arithmetic number, because the mean of its divisors is an integer number (1211686746816).
Almost surely, 210011011210019 is an apocalyptic number.
10011011210019 is a deficient number, since it is larger than the sum of its proper divisors (4529229751773).
10011011210019 is a wasteful number, since it uses less digits than its factorization.
10011011210019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6145495098 (or 6145495095 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
The spelling of 10011011210019 in words is "ten trillion, eleven billion, eleven million, two hundred ten thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •