Base | Representation |
---|---|
bin | 11011100000111011010110… |
… | …101010101011110010000001 |
3 | 120212110102222122222210101020 |
4 | 123200323112222223302001 |
5 | 111330112000042023410 |
6 | 1105211121534500053 |
7 | 34326453600366453 |
oct | 3340732652536201 |
9 | 525412878883336 |
10 | 121010010111105 |
11 | 35615069a8a7a5 |
12 | 116a4673664629 |
13 | 526a26c512c7b |
14 | 21c4cb6b0c2d3 |
15 | decb34ac5a70 |
hex | 6e0ed6aabc81 |
121010010111105 has 16 divisors (see below), whose sum is σ = 196268290373760. Its totient is φ = 63654580660608.
The previous prime is 121010010111101. The next prime is 121010010111157. The reversal of 121010010111105 is 501111010010121.
It is not a de Polignac number, because 121010010111105 - 22 = 121010010111101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (121010010111101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55255711285 + ... + 55255713474.
It is an arithmetic number, because the mean of its divisors is an integer number (12266768148360).
Almost surely, 2121010010111105 is an apocalyptic number.
121010010111105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
121010010111105 is a deficient number, since it is larger than the sum of its proper divisors (75258280262655).
121010010111105 is a wasteful number, since it uses less digits than its factorization.
121010010111105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110511424840.
The product of its (nonzero) digits is 10, while the sum is 15.
Adding to 121010010111105 its reverse (501111010010121), we get a palindrome (622121020121226).
The spelling of 121010010111105 in words is "one hundred twenty-one trillion, ten billion, ten million, one hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •