Base | Representation |
---|---|
bin | 1001001100010001101101… |
… | …00101111010001101101101 |
3 | 2122120100100221202111200012 |
4 | 10212020312211322031231 |
5 | 10122132242143034123 |
6 | 110553423321143005 |
7 | 4154225530122005 |
oct | 446106645721555 |
9 | 78510327674605 |
10 | 20213032002413 |
11 | 6493331681568 |
12 | 232550762aa65 |
13 | b381084cb133 |
14 | 4dc45d039005 |
15 | 250bc247e378 |
hex | 12623697a36d |
20213032002413 has 2 divisors, whose sum is σ = 20213032002414. Its totient is φ = 20213032002412.
The previous prime is 20213032002409. The next prime is 20213032002433. The reversal of 20213032002413 is 31420023031202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18243943891849 + 1969088110564 = 4271293^2 + 1403242^2 .
It is a cyclic number.
It is not a de Polignac number, because 20213032002413 - 22 = 20213032002409 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20213032002433) 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, 10106516001206 + 10106516001207.
It is an arithmetic number, because the mean of its divisors is an integer number (10106516001207).
Almost surely, 220213032002413 is an apocalyptic number.
It is an amenable number.
20213032002413 is a deficient number, since it is larger than the sum of its proper divisors (1).
20213032002413 is an equidigital number, since it uses as much as digits as its factorization.
20213032002413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 20213032002413 its reverse (31420023031202), we get a palindrome (51633055033615).
The spelling of 20213032002413 in words is "twenty trillion, two hundred thirteen billion, thirty-two million, two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •