Base | Representation |
---|---|
bin | 1001001001001000110001… |
… | …00111111010110100111101 |
3 | 2122012000220211012112002211 |
4 | 10210210120213322310331 |
5 | 10113400324141432313 |
6 | 110432103011220421 |
7 | 4143356325025222 |
oct | 444443047726475 |
9 | 78160824175084 |
10 | 20105155030333 |
11 | 645160396878a |
12 | 230861b8a7711 |
13 | b2aba5ac2789 |
14 | 4d7147bb7949 |
15 | 24ceab94be3d |
hex | 1249189fad3d |
20105155030333 has 2 divisors, whose sum is σ = 20105155030334. Its totient is φ = 20105155030332.
The previous prime is 20105155030321. The next prime is 20105155030343. The reversal of 20105155030333 is 33303055150102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19359137609604 + 746017420729 = 4399902^2 + 863723^2 .
It is a cyclic number.
It is not a de Polignac number, because 20105155030333 - 29 = 20105155029821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20105155030295 and 20105155030304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20105155030343) 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, 10052577515166 + 10052577515167.
It is an arithmetic number, because the mean of its divisors is an integer number (10052577515167).
Almost surely, 220105155030333 is an apocalyptic number.
It is an amenable number.
20105155030333 is a deficient number, since it is larger than the sum of its proper divisors (1).
20105155030333 is an equidigital number, since it uses as much as digits as its factorization.
20105155030333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20250, while the sum is 31.
The spelling of 20105155030333 in words is "twenty trillion, one hundred five billion, one hundred fifty-five million, thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •