Base | Representation |
---|---|
bin | 11011100001000100110000… |
… | …110110010011001101011111 |
3 | 120212111102001202102202201011 |
4 | 123201010300312103031133 |
5 | 111330243142414241343 |
6 | 1105215512235400051 |
7 | 34330262135023345 |
oct | 3341046066231537 |
9 | 525442052382634 |
10 | 121020113040223 |
11 | 356193839069a1 |
12 | 116a6612bb3027 |
13 | 526b1bc62b237 |
14 | 21c55947c5995 |
15 | ded026a1629d |
hex | 6e1130d9335f |
121020113040223 has 2 divisors, whose sum is σ = 121020113040224. Its totient is φ = 121020113040222.
The previous prime is 121020113040149. The next prime is 121020113040227. The reversal of 121020113040223 is 322040311020121.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121020113040223 is a prime.
It is a super-3 number, since 3×1210201130402233 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121020113040194 and 121020113040203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121020113040227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510056520111 + 60510056520112.
It is an arithmetic number, because the mean of its divisors is an integer number (60510056520112).
Almost surely, 2121020113040223 is an apocalyptic number.
121020113040223 is a deficient number, since it is larger than the sum of its proper divisors (1).
121020113040223 is an equidigital number, since it uses as much as digits as its factorization.
121020113040223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 121020113040223 its reverse (322040311020121), we get a palindrome (443060424060344).
The spelling of 121020113040223 in words is "one hundred twenty-one trillion, twenty billion, one hundred thirteen million, forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •