Base | Representation |
---|---|
bin | 1001001101110100011100… |
… | …0100111100101110101001 |
3 | 1022212201002121110012120101 |
4 | 2103131013010330232221 |
5 | 2312004411201042141 |
6 | 33315013440225401 |
7 | 2064041455452205 |
oct | 223350704745651 |
9 | 38781077405511 |
10 | 10133020330921 |
11 | 325743189a504 |
12 | 1177a2000b261 |
13 | 5867029b24c7 |
14 | 2706257b3b05 |
15 | 1288b3014531 |
hex | 9374713cba9 |
10133020330921 has 2 divisors, whose sum is σ = 10133020330922. Its totient is φ = 10133020330920.
The previous prime is 10133020330879. The next prime is 10133020331033. The reversal of 10133020330921 is 12903302033101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6185348065296 + 3947672265625 = 2487036^2 + 1986875^2 .
It is a cyclic number.
It is not a de Polignac number, because 10133020330921 - 27 = 10133020330793 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10133020330921.
It is not a weakly prime, because it can be changed into another prime (10133020333921) 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, 5066510165460 + 5066510165461.
It is an arithmetic number, because the mean of its divisors is an integer number (5066510165461).
Almost surely, 210133020330921 is an apocalyptic number.
It is an amenable number.
10133020330921 is a deficient number, since it is larger than the sum of its proper divisors (1).
10133020330921 is an equidigital number, since it uses as much as digits as its factorization.
10133020330921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 10133020330921 in words is "ten trillion, one hundred thirty-three billion, twenty million, three hundred thirty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •