Base | Representation |
---|---|
bin | 1001000110101110101111… |
… | …0111111010000010101101 |
3 | 1022110001201220112022011211 |
4 | 2101223223313322002231 |
5 | 2303011000130213401 |
6 | 33143032430314421 |
7 | 2052200432210266 |
oct | 221535367720255 |
9 | 38401656468154 |
10 | 10011231101101 |
11 | 320a814a6755a |
12 | 11582b1058a11 |
13 | 578093c09389 |
14 | 26879099996d |
15 | 125635e31951 |
hex | 91aebdfa0ad |
10011231101101 has 24 divisors (see below), whose sum is σ = 10312026651000. Its totient is φ = 9715370649600.
The previous prime is 10011231101077. The next prime is 10011231101147. The reversal of 10011231101101 is 10110113211001.
It can be written as a sum of positive squares in 4 ways, for example, as 1259840125476 + 8751390975625 = 1122426^2 + 2958275^2 .
It is not a de Polignac number, because 10011231101101 - 27 = 10011231100973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011231101171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1308824925 + ... + 1308832573.
It is an arithmetic number, because the mean of its divisors is an integer number (429667777125).
Almost surely, 210011231101101 is an apocalyptic number.
It is an amenable number.
10011231101101 is a deficient number, since it is larger than the sum of its proper divisors (300795549899).
10011231101101 is an frugal number, since it uses more digits than its factorization.
10011231101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8781 (or 8290 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 10011231101101 its reverse (10110113211001), we get a palindrome (20121344312102).
The spelling of 10011231101101 in words is "ten trillion, eleven billion, two hundred thirty-one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •