Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …110101001001011101111001 |
3 | 111020122110111100101120200002 |
4 | 112331320321311021131321 |
5 | 101214422000320213144 |
6 | 554455205233522345 |
7 | 30163506144636641 |
oct | 2675707165113571 |
9 | 436573440346602 |
10 | 101010011101049 |
11 | 2a204117a394a6 |
12 | b3b45004133b5 |
13 | 44492844b79cb |
14 | 1ad2ca6a6b521 |
15 | ba277ed8814e |
hex | 5bde39d49779 |
101010011101049 has 2 divisors, whose sum is σ = 101010011101050. Its totient is φ = 101010011101048.
The previous prime is 101010011101039. The next prime is 101010011101123. The reversal of 101010011101049 is 940101110010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56719455437824 + 44290555663225 = 7531232^2 + 6655115^2 .
It is a cyclic number.
It is not a de Polignac number, because 101010011101049 - 228 = 101009742665593 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101010011101049.
It is not a weakly prime, because it can be changed into another prime (101010011101009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505005550524 + 50505005550525.
It is an arithmetic number, because the mean of its divisors is an integer number (50505005550525).
Almost surely, 2101010011101049 is an apocalyptic number.
It is an amenable number.
101010011101049 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010011101049 is an equidigital number, since it uses as much as digits as its factorization.
101010011101049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 101010011101049 in words is "one hundred one trillion, ten billion, eleven million, one hundred one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •