Base | Representation |
---|---|
bin | 11011100010011000011110… |
… | …100001110101110000010111 |
3 | 120212211000002010121102211102 |
4 | 123202120132201311300113 |
5 | 111333231240000000043 |
6 | 1105325055501100315 |
7 | 34336623462413546 |
oct | 3342303641656027 |
9 | 525730063542742 |
10 | 121110000000023 |
11 | 3565350a73a231 |
12 | 116bbb19b5769b |
13 | 5276815bc2408 |
14 | 21c9a8069a15d |
15 | e00537eb46b8 |
hex | 6e261e875c17 |
121110000000023 has 6 divisors (see below), whose sum is σ = 127819695291264. Its totient is φ = 114735789473364.
The previous prime is 121109999999993. The next prime is 121110000000047. The reversal of 121110000000023 is 320000000011121.
It is not a de Polignac number, because 121110000000023 - 28 = 121109999999767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121109999999941 and 121110000000013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121110000003023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 167742381911 + ... + 167742382632.
It is an arithmetic number, because the mean of its divisors is an integer number (21303282548544).
Almost surely, 2121110000000023 is an apocalyptic number.
121110000000023 is a deficient number, since it is larger than the sum of its proper divisors (6709695291241).
121110000000023 is an equidigital number, since it uses as much as digits as its factorization.
121110000000023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335484764581 (or 335484764562 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 121110000000023 its reverse (320000000011121), we get a palindrome (441110000011144).
The spelling of 121110000000023 in words is "one hundred twenty-one trillion, one hundred ten billion, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •