Base | Representation |
---|---|
bin | 1001000111110101111001… |
… | …1011111100100000111101 |
3 | 1022111220001011011100001202 |
4 | 2101331132123330200331 |
5 | 2303314110223121341 |
6 | 33155512114545245 |
7 | 2053445000640503 |
oct | 221753633744075 |
9 | 38456034140052 |
10 | 10030333020221 |
11 | 3217927555078 |
12 | 115bb42298225 |
13 | 579b1950ccb7 |
14 | 2696838a4673 |
15 | 125da2dee79b |
hex | 91f5e6fc83d |
10030333020221 has 2 divisors, whose sum is σ = 10030333020222. Its totient is φ = 10030333020220.
The previous prime is 10030333020133. The next prime is 10030333020247. The reversal of 10030333020221 is 12202033303001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6021772444900 + 4008560575321 = 2453930^2 + 2002139^2 .
It is a cyclic number.
It is not a de Polignac number, because 10030333020221 - 234 = 10013153151037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10030333020193 and 10030333020202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10030333020121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015166510110 + 5015166510111.
It is an arithmetic number, because the mean of its divisors is an integer number (5015166510111).
Almost surely, 210030333020221 is an apocalyptic number.
It is an amenable number.
10030333020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10030333020221 is an equidigital number, since it uses as much as digits as its factorization.
10030333020221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10030333020221 its reverse (12202033303001), we get a palindrome (22232366323222).
The spelling of 10030333020221 in words is "ten trillion, thirty billion, three hundred thirty-three million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •