Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1100101010000100011010 |
3 | 1102221200111121100110011012 |
4 | 2200011132230222010122 |
5 | 2420220022000310020 |
6 | 35221442321133522 |
7 | 2213540015135363 |
oct | 240053654520432 |
9 | 42850447313135 |
10 | 11001000010010 |
11 | 356155278a26a |
12 | 129809878a2a2 |
13 | 61a50b66595a |
14 | 2a06462c6b6a |
15 | 14126438d7c5 |
hex | a015eb2a11a |
11001000010010 has 8 divisors (see below), whose sum is σ = 19801800018036. Its totient is φ = 4400400004000.
The previous prime is 11001000010001. The next prime is 11001000010043. The reversal of 11001000010010 is 1001000010011.
It can be written as a sum of positive squares in 2 ways, for example, as 10728684068089 + 272315941921 = 3275467^2 + 521839^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 11001000009976 and 11001000010003.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550050000491 + ... + 550050000510.
Almost surely, 211001000010010 is an apocalyptic number.
11001000010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001000010010 is a deficient number, since it is larger than the sum of its proper divisors (8800800008026).
11001000010010 is a wasteful number, since it uses less digits than its factorization.
11001000010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1100100001008.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11001000010010 its reverse (1001000010011), we get a palindrome (12002000020021).
Subtracting from 11001000010010 its reverse (1001000010011), we obtain a palindrome (9999999999999).
The spelling of 11001000010010 in words is "eleven trillion, one billion, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •