Base | Representation |
---|---|
bin | 10110111111001101110000… |
… | …011001111010010100011001 |
3 | 111020222011122221210002000111 |
4 | 112333031300121322110121 |
5 | 101222420043440134314 |
6 | 555005114103404321 |
7 | 30203213012324221 |
oct | 2677156031722431 |
9 | 436864587702014 |
10 | 101101121021209 |
11 | 2a23982112aa81 |
12 | b40a0a8a536a1 |
13 | 4454a4425207a |
14 | 1ad746b12b081 |
15 | ba4d138a9ec4 |
hex | 5bf37067a519 |
101101121021209 has 2 divisors, whose sum is σ = 101101121021210. Its totient is φ = 101101121021208.
The previous prime is 101101121021207. The next prime is 101101121021249. The reversal of 101101121021209 is 902120121101101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90706480760025 + 10394640261184 = 9523995^2 + 3224072^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101121021209 - 21 = 101101121021207 is a prime.
Together with 101101121021207, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 101101121021209.
It is not a weakly prime, because it can be changed into another prime (101101121021203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550560510604 + 50550560510605.
It is an arithmetic number, because the mean of its divisors is an integer number (50550560510605).
Almost surely, 2101101121021209 is an apocalyptic number.
It is an amenable number.
101101121021209 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101121021209 is an equidigital number, since it uses as much as digits as its factorization.
101101121021209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 101101121021209 in words is "one hundred one trillion, one hundred one billion, one hundred twenty-one million, twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •