Base | Representation |
---|---|
bin | 1001000110101010111100… |
… | …0111011000110011010101 |
3 | 1022102222002212102212002011 |
4 | 2101222233013120303111 |
5 | 2303001403201432302 |
6 | 33142343334144221 |
7 | 2052133243646431 |
oct | 221525707306325 |
9 | 38388085385064 |
10 | 10010211749077 |
11 | 320a341626271 |
12 | 11580677b2071 |
13 | 577c609849b7 |
14 | 2686d54519c1 |
15 | 1255c66cb5d7 |
hex | 91aaf1d8cd5 |
10010211749077 has 2 divisors, whose sum is σ = 10010211749078. Its totient is φ = 10010211749076.
The previous prime is 10010211749059. The next prime is 10010211749119. The reversal of 10010211749077 is 77094711201001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9572780308081 + 437431440996 = 3093991^2 + 661386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010211749077 is a prime.
It is a super-2 number, since 2×100102117490772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010211749177) 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, 5005105874538 + 5005105874539.
It is an arithmetic number, because the mean of its divisors is an integer number (5005105874539).
Almost surely, 210010211749077 is an apocalyptic number.
It is an amenable number.
10010211749077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010211749077 is an equidigital number, since it uses as much as digits as its factorization.
10010211749077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24696, while the sum is 40.
The spelling of 10010211749077 in words is "ten trillion, ten billion, two hundred eleven million, seven hundred forty-nine thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •