Base | Representation |
---|---|
bin | 10110111110001011101000… |
… | …100010100001100100001001 |
3 | 111020201101101220210020020011 |
4 | 112332023220202201210021 |
5 | 101220234142224213001 |
6 | 554512333010231521 |
7 | 30165120415421602 |
oct | 2676135042414411 |
9 | 436641356706204 |
10 | 101030122101001 |
11 | 2a2116a8092415 |
12 | b3b83935855a1 |
13 | 444b13ab87b92 |
14 | 1ad3c539a8da9 |
15 | ba305a72cd51 |
hex | 5be2e88a1909 |
101030122101001 has 2 divisors, whose sum is σ = 101030122101002. Its totient is φ = 101030122101000.
The previous prime is 101030122100927. The next prime is 101030122101043. The reversal of 101030122101001 is 100101221030101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89280274982976 + 11749847118025 = 9448824^2 + 3427805^2 .
It is an emirp because it is prime and its reverse (100101221030101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101030122101001 - 227 = 101029987883273 is a prime.
It is not a weakly prime, because it can be changed into another prime (101030122101071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50515061050500 + 50515061050501.
It is an arithmetic number, because the mean of its divisors is an integer number (50515061050501).
Almost surely, 2101030122101001 is an apocalyptic number.
It is an amenable number.
101030122101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101030122101001 is an equidigital number, since it uses as much as digits as its factorization.
101030122101001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101030122101001 its reverse (100101221030101), we get a palindrome (201131343131102).
The spelling of 101030122101001 in words is "one hundred one trillion, thirty billion, one hundred twenty-two million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •