Base | Representation |
---|---|
bin | 11011100010100011000000… |
… | …001011100011100101100111 |
3 | 120212212002020210022121221002 |
4 | 123202203000023203211213 |
5 | 111333422411303031043 |
6 | 1105334205154143515 |
7 | 34340503530014651 |
oct | 3342430013434547 |
9 | 525762223277832 |
10 | 121121302002023 |
11 | 3565828a399654 |
12 | 11702152b81b9b |
13 | 52778c7568b6b |
14 | 21ca4337016d1 |
15 | e0099a30abb8 |
hex | 6e28c02e3967 |
121121302002023 has 2 divisors, whose sum is σ = 121121302002024. Its totient is φ = 121121302002022.
The previous prime is 121121302001981. The next prime is 121121302002073. The reversal of 121121302002023 is 320200203121121.
It is a weak prime.
It is an emirp because it is prime and its reverse (320200203121121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121121302002023 - 246 = 50752557824359 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121121302001986 and 121121302002004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121121302002073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60560651001011 + 60560651001012.
It is an arithmetic number, because the mean of its divisors is an integer number (60560651001012).
Almost surely, 2121121302002023 is an apocalyptic number.
121121302002023 is a deficient number, since it is larger than the sum of its proper divisors (1).
121121302002023 is an equidigital number, since it uses as much as digits as its factorization.
121121302002023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 121121302002023 its reverse (320200203121121), we get a palindrome (441321505123144).
The spelling of 121121302002023 in words is "one hundred twenty-one trillion, one hundred twenty-one billion, three hundred two million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •