Base | Representation |
---|---|
bin | 10111000000111101011001… |
… | …110100001101000011100011 |
3 | 111021101122002121100011202012 |
4 | 113000331121310031003203 |
5 | 101231401102241401034 |
6 | 555140141434143135 |
7 | 30214655524345262 |
oct | 2700753164150343 |
9 | 437348077304665 |
10 | 101221001122019 |
11 | 2a285649342059 |
12 | b429384581aab |
13 | 446313a64936c |
14 | 1add1a05825d9 |
15 | ba7ecd079cce |
hex | 5c0f59d0d0e3 |
101221001122019 has 2 divisors, whose sum is σ = 101221001122020. Its totient is φ = 101221001122018.
The previous prime is 101221001121983. The next prime is 101221001122037. The reversal of 101221001122019 is 910221100122101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101221001122019 is a prime.
It is a super-2 number, since 2×1012210011220192 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 101221001121985 and 101221001122003.
It is not a weakly prime, because it can be changed into another prime (101221001122099) 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, 50610500561009 + 50610500561010.
It is an arithmetic number, because the mean of its divisors is an integer number (50610500561010).
Almost surely, 2101221001122019 is an apocalyptic number.
101221001122019 is a deficient number, since it is larger than the sum of its proper divisors (1).
101221001122019 is an equidigital number, since it uses as much as digits as its factorization.
101221001122019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 101221001122019 in words is "one hundred one trillion, two hundred twenty-one billion, one million, one hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •