Base | Representation |
---|---|
bin | 1001001100001101111100… |
… | …00100101000001101110101 |
3 | 2122120011011001000202022011 |
4 | 10212012332010220031311 |
5 | 10122114122030341041 |
6 | 110552450531004221 |
7 | 4154124445361203 |
oct | 446067604501565 |
9 | 78504131022264 |
10 | 20211010012021 |
11 | 6492494285224 |
12 | 2325042439671 |
13 | b37b7562470a |
14 | 4dc30a698073 |
15 | 250b04bc5e81 |
hex | 1261be128375 |
20211010012021 has 2 divisors, whose sum is σ = 20211010012022. Its totient is φ = 20211010012020.
The previous prime is 20211010012013. The next prime is 20211010012033. The reversal of 20211010012021 is 12021001011202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20005814601796 + 205195410225 = 4472786^2 + 452985^2 .
It is a cyclic number.
It is not a de Polignac number, because 20211010012021 - 23 = 20211010012013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20211010011992 and 20211010012010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20211019012021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10105505006010 + 10105505006011.
It is an arithmetic number, because the mean of its divisors is an integer number (10105505006011).
Almost surely, 220211010012021 is an apocalyptic number.
It is an amenable number.
20211010012021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20211010012021 is an equidigital number, since it uses as much as digits as its factorization.
20211010012021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20211010012021 its reverse (12021001011202), we get a palindrome (32232011023223).
The spelling of 20211010012021 in words is "twenty trillion, two hundred eleven billion, ten million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •