Base | Representation |
---|---|
bin | 1001100100000011111111… |
… | …01111011001100111010101 |
3 | 2202110110212222100111122221 |
4 | 10302001333233121213111 |
5 | 10224030030032411313 |
6 | 112421104323222341 |
7 | 4300250341106365 |
oct | 462017757314725 |
9 | 82413788314587 |
10 | 21030303013333 |
11 | 67789a08793a9 |
12 | 2437991b179b1 |
13 | b971c2658ba3 |
14 | 529c2d0689a5 |
15 | 2670a6b2cc8d |
hex | 13207fbd99d5 |
21030303013333 has 2 divisors, whose sum is σ = 21030303013334. Its totient is φ = 21030303013332.
The previous prime is 21030303013319. The next prime is 21030303013361. The reversal of 21030303013333 is 33331030303012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20945285866404 + 85017146929 = 4576602^2 + 291577^2 .
It is a cyclic number.
It is not a de Polignac number, because 21030303013333 - 25 = 21030303013301 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21030303013298 and 21030303013307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21030303013393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10515151506666 + 10515151506667.
It is an arithmetic number, because the mean of its divisors is an integer number (10515151506667).
Almost surely, 221030303013333 is an apocalyptic number.
It is an amenable number.
21030303013333 is a deficient number, since it is larger than the sum of its proper divisors (1).
21030303013333 is an equidigital number, since it uses as much as digits as its factorization.
21030303013333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 21030303013333 its reverse (33331030303012), we get a palindrome (54361333316345).
The spelling of 21030303013333 in words is "twenty-one trillion, thirty billion, three hundred three million, thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •