Base | Representation |
---|---|
bin | 1001001101001011011011… |
… | …1000000110101001111011 |
3 | 1022211122200100122211121210 |
4 | 2103102312320012221323 |
5 | 2311314334321010021 |
6 | 33305553202334203 |
7 | 2063201604563223 |
oct | 223226670065173 |
9 | 38748610584553 |
10 | 10122011110011 |
11 | 32527a2433929 |
12 | 117586905a363 |
13 | 585669ba9ac8 |
14 | 26dc9d5c3083 |
15 | 12846b752e76 |
hex | 934b6e06a7b |
10122011110011 has 16 divisors (see below), whose sum is σ = 13623393763584. Its totient is φ = 6684329487264.
The previous prime is 10122011109953. The next prime is 10122011110019. The reversal of 10122011110011 is 11001111022101.
It is not a de Polignac number, because 10122011110011 - 219 = 10122010585723 is a prime.
It is a super-2 number, since 2×101220111100112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10122011110019) 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 15 ways as a sum of consecutive naturals, for example, 2078266 + ... + 4956128.
It is an arithmetic number, because the mean of its divisors is an integer number (851462110224).
Almost surely, 210122011110011 is an apocalyptic number.
10122011110011 is a deficient number, since it is larger than the sum of its proper divisors (3501382653573).
10122011110011 is a wasteful number, since it uses less digits than its factorization.
10122011110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2888930.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10122011110011 its reverse (11001111022101), we get a palindrome (21123122132112).
It can be divided in two parts, 1012201 and 1110011, that added together give a palindrome (2122212).
The spelling of 10122011110011 in words is "ten trillion, one hundred twenty-two billion, eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •