Base | Representation |
---|---|
bin | 1001001110111000001111… |
… | …10011100000100010100011 |
3 | 2122212220011001020000211112 |
4 | 10213130013303200202203 |
5 | 10130113344441220311 |
6 | 111102451321533535 |
7 | 4163542265054516 |
oct | 447340763404243 |
9 | 78786131200745 |
10 | 20302441351331 |
11 | 651824294a767 |
12 | 233a8ba6442ab |
13 | b43686b48c19 |
14 | 502901704d7d |
15 | 2531a6a3828b |
hex | 127707ce08a3 |
20302441351331 has 2 divisors, whose sum is σ = 20302441351332. Its totient is φ = 20302441351330.
The previous prime is 20302441351289. The next prime is 20302441351363. The reversal of 20302441351331 is 13315314420302.
It is an a-pointer prime, because the next prime (20302441351363) can be obtained adding 20302441351331 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20302441351331 - 222 = 20302437157027 is a prime.
It is a super-2 number, since 2×203024413513312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20302441351931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10151220675665 + 10151220675666.
It is an arithmetic number, because the mean of its divisors is an integer number (10151220675666).
Almost surely, 220302441351331 is an apocalyptic number.
20302441351331 is a deficient number, since it is larger than the sum of its proper divisors (1).
20302441351331 is an equidigital number, since it uses as much as digits as its factorization.
20302441351331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 20302441351331 its reverse (13315314420302), we get a palindrome (33617755771633).
The spelling of 20302441351331 in words is "twenty trillion, three hundred two billion, four hundred forty-one million, three hundred fifty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •