Base | Representation |
---|---|
bin | 11001101100101100001001… |
… | …011101011011010000101101 |
3 | 112211011211010001111122211212 |
4 | 121230230021131123100231 |
5 | 104303224003103244041 |
6 | 1040213405325324205 |
7 | 32543405023161521 |
oct | 3154541135332055 |
9 | 484154101448755 |
10 | 113022223103021 |
11 | 33015501505111 |
12 | 10814569a06665 |
13 | 4b0ac46c3925b |
14 | 1dca43a491d81 |
15 | d0ee79e548eb |
hex | 66cb0975b42d |
113022223103021 has 2 divisors, whose sum is σ = 113022223103022. Its totient is φ = 113022223103020.
The previous prime is 113022223102993. The next prime is 113022223103033. The reversal of 113022223103021 is 120301322220311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112621548028900 + 400675074121 = 10612330^2 + 632989^2 .
It is a cyclic number.
It is not a de Polignac number, because 113022223103021 - 222 = 113022218908717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113022223109021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56511111551510 + 56511111551511.
It is an arithmetic number, because the mean of its divisors is an integer number (56511111551511).
Almost surely, 2113022223103021 is an apocalyptic number.
It is an amenable number.
113022223103021 is a deficient number, since it is larger than the sum of its proper divisors (1).
113022223103021 is an equidigital number, since it uses as much as digits as its factorization.
113022223103021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 113022223103021 its reverse (120301322220311), we get a palindrome (233323545323332).
The spelling of 113022223103021 in words is "one hundred thirteen trillion, twenty-two billion, two hundred twenty-three million, one hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •