Base | Representation |
---|---|
bin | 1001001011111101001011… |
… | …10000110100010101011001 |
3 | 2122112021220222010010011021 |
4 | 10211332211300310111121 |
5 | 10121442210112343001 |
6 | 110544402025202441 |
7 | 4153355460451366 |
oct | 445764560642531 |
9 | 78467828103137 |
10 | 20202012231001 |
11 | 648969726a167 |
12 | 2323351030421 |
13 | b37070470433 |
14 | 4dbad569d46d |
15 | 250779cd6ba1 |
hex | 125fa5c34559 |
20202012231001 has 2 divisors, whose sum is σ = 20202012231002. Its totient is φ = 20202012231000.
The previous prime is 20202012230963. The next prime is 20202012231019. The reversal of 20202012231001 is 10013221020202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20093030375625 + 108981855376 = 4482525^2 + 330124^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202012231001 - 235 = 20167652492633 is a prime.
It is not a weakly prime, because it can be changed into another prime (20202012331001) 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, 10101006115500 + 10101006115501.
It is an arithmetic number, because the mean of its divisors is an integer number (10101006115501).
Almost surely, 220202012231001 is an apocalyptic number.
It is an amenable number.
20202012231001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202012231001 is an equidigital number, since it uses as much as digits as its factorization.
20202012231001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20202012231001 its reverse (10013221020202), we get a palindrome (30215233251203).
The spelling of 20202012231001 in words is "twenty trillion, two hundred two billion, twelve million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •