Base | Representation |
---|---|
bin | 1001100110101011011110… |
… | …10101001100000111001001 |
3 | 2202210001222120211022212201 |
4 | 10303111233111030013021 |
5 | 10232013203314120131 |
6 | 112530255051440201 |
7 | 4306612535052034 |
oct | 463255725140711 |
9 | 82701876738781 |
10 | 21120222020041 |
11 | 68030437aaa91 |
12 | 24512a7756061 |
13 | ba2822760931 |
14 | 53031d2c201b |
15 | 2695bad0b761 |
hex | 13356f54c1c9 |
21120222020041 has 2 divisors, whose sum is σ = 21120222020042. Its totient is φ = 21120222020040.
The previous prime is 21120222019997. The next prime is 21120222020047. The reversal of 21120222020041 is 14002022202112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20083806398016 + 1036415622025 = 4481496^2 + 1018045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21120222020041 is a prime.
It is not a weakly prime, because it can be changed into another prime (21120222020047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560111010020 + 10560111010021.
It is an arithmetic number, because the mean of its divisors is an integer number (10560111010021).
Almost surely, 221120222020041 is an apocalyptic number.
It is an amenable number.
21120222020041 is a deficient number, since it is larger than the sum of its proper divisors (1).
21120222020041 is an equidigital number, since it uses as much as digits as its factorization.
21120222020041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 21120222020041 its reverse (14002022202112), we get a palindrome (35122244222153).
The spelling of 21120222020041 in words is "twenty-one trillion, one hundred twenty billion, two hundred twenty-two million, twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •