Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000101110110000111001 |
3 | 1022202120011210221021120201 |
4 | 2102332132020232300321 |
5 | 2310440022011423341 |
6 | 33251533121522201 |
7 | 2061465263460505 |
oct | 222763610566071 |
9 | 38676153837521 |
10 | 10100121201721 |
11 | 324448a121831 |
12 | 117157a1a3361 |
13 | 58358bac2b55 |
14 | 26cbc42dd305 |
15 | 127ad9b1e331 |
hex | 92f9e22ec39 |
10100121201721 has 2 divisors, whose sum is σ = 10100121201722. Its totient is φ = 10100121201720.
The previous prime is 10100121201697. The next prime is 10100121201727. The reversal of 10100121201721 is 12710212100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5302864812025 + 4797256389696 = 2302795^2 + 2190264^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100121201721 - 25 = 10100121201689 is a prime.
It is not a weakly prime, because it can be changed into another prime (10100121201727) 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, 5050060600860 + 5050060600861.
It is an arithmetic number, because the mean of its divisors is an integer number (5050060600861).
Almost surely, 210100121201721 is an apocalyptic number.
It is an amenable number.
10100121201721 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100121201721 is an equidigital number, since it uses as much as digits as its factorization.
10100121201721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 10100121201721 its reverse (12710212100101), we get a palindrome (22810333301822).
The spelling of 10100121201721 in words is "ten trillion, one hundred billion, one hundred twenty-one million, two hundred one thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •