Base | Representation |
---|---|
bin | 1001010010010111010110… |
… | …0101011110011111111111 |
3 | 1100011011122210222111011110 |
4 | 2110211311211132133333 |
5 | 2314244323131133434 |
6 | 33414530313253103 |
7 | 2102504553044400 |
oct | 224456545363777 |
9 | 40134583874143 |
10 | 10211110021119 |
11 | 3287564449557 |
12 | 118ab94104193 |
13 | 590b99113b97 |
14 | 27431295d9a7 |
15 | 12a93393a4e9 |
hex | 9497595e7ff |
10211110021119 has 48 divisors (see below), whose sum is σ = 16174163345760. Its totient is φ = 5712236006400.
The previous prime is 10211110021051. The next prime is 10211110021121. The reversal of 10211110021119 is 91112001111201.
It is a happy number.
It is not a de Polignac number, because 10211110021119 - 225 = 10211076466687 is a prime.
It is a super-2 number, since 2×102111100211192 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 10211110021095 and 10211110021104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211110521119) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2542414 + ... + 5185179.
It is an arithmetic number, because the mean of its divisors is an integer number (336961736370).
Almost surely, 210211110021119 is an apocalyptic number.
10211110021119 is a deficient number, since it is larger than the sum of its proper divisors (5963053324641).
10211110021119 is a wasteful number, since it uses less digits than its factorization.
10211110021119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7727800 (or 7727793 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 21.
The spelling of 10211110021119 in words is "ten trillion, two hundred eleven billion, one hundred ten million, twenty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •