Base | Representation |
---|---|
bin | 1001000111010000100110… |
… | …1000111010000010110101 |
3 | 1022110221012100200112201022 |
4 | 2101310021220322002311 |
5 | 2303133104011420041 |
6 | 33151134402110525 |
7 | 2052641611146332 |
oct | 221641150720265 |
9 | 38427170615638 |
10 | 10020320420021 |
11 | 321365971437a |
12 | 115a00904b445 |
13 | 578bb20305b2 |
14 | 268db3bc1989 |
15 | 1259b8da324b |
hex | 91d09a3a0b5 |
10020320420021 has 2 divisors, whose sum is σ = 10020320420022. Its totient is φ = 10020320420020.
The previous prime is 10020320420017. The next prime is 10020320420039. The reversal of 10020320420021 is 12002402302001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9892220136100 + 128100283921 = 3145190^2 + 357911^2 .
It is a cyclic number.
It is not a de Polignac number, because 10020320420021 - 22 = 10020320420017 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10020320420041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010160210010 + 5010160210011.
It is an arithmetic number, because the mean of its divisors is an integer number (5010160210011).
Almost surely, 210020320420021 is an apocalyptic number.
It is an amenable number.
10020320420021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10020320420021 is an equidigital number, since it uses as much as digits as its factorization.
10020320420021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 10020320420021 its reverse (12002402302001), we get a palindrome (22022722722022).
The spelling of 10020320420021 in words is "ten trillion, twenty billion, three hundred twenty million, four hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •