Base | Representation |
---|---|
bin | 11011100001000100110000… |
… | …101110111001101000000111 |
3 | 120212111102001121210012210201 |
4 | 123201010300232321220013 |
5 | 111330243141420203143 |
6 | 1105215512130031331 |
7 | 34330262112364063 |
oct | 3341046056715007 |
9 | 525442047705721 |
10 | 121020111100423 |
11 | 35619382801557 |
12 | 116a6612418547 |
13 | 526b1bc0cc322 |
14 | 21c559443caa3 |
15 | ded02678164d |
hex | 6e1130bb9a07 |
121020111100423 has 2 divisors, whose sum is σ = 121020111100424. Its totient is φ = 121020111100422.
The previous prime is 121020111100411. The next prime is 121020111100459. The reversal of 121020111100423 is 324001111020121.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121020111100423 is a prime.
It is a super-3 number, since 3×1210201111004233 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121020111100423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121020111500423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510055550211 + 60510055550212.
It is an arithmetic number, because the mean of its divisors is an integer number (60510055550212).
Almost surely, 2121020111100423 is an apocalyptic number.
121020111100423 is a deficient number, since it is larger than the sum of its proper divisors (1).
121020111100423 is an equidigital number, since it uses as much as digits as its factorization.
121020111100423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 121020111100423 its reverse (324001111020121), we get a palindrome (445021222120544).
The spelling of 121020111100423 in words is "one hundred twenty-one trillion, twenty billion, one hundred eleven million, one hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •