Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …111110001110001011100001 |
3 | 111021022201112020020212200001 |
4 | 113000222302332032023201 |
5 | 101231034143123140214 |
6 | 555123035134100001 |
7 | 30213350445334414 |
oct | 2700526276161341 |
9 | 437281466225601 |
10 | 101201022083809 |
11 | 2a27812672aa2a |
12 | b42552964a601 |
13 | 44612a540086b |
14 | 1adc226d95b7b |
15 | ba770e09ec74 |
hex | 5c0ab2f8e2e1 |
101201022083809 has 2 divisors, whose sum is σ = 101201022083810. Its totient is φ = 101201022083808.
The previous prime is 101201022083779. The next prime is 101201022083831. The reversal of 101201022083809 is 908380220102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75449253939409 + 25751768144400 = 8686153^2 + 5074620^2 .
It is an emirp because it is prime and its reverse (908380220102101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101201022083809 is a prime.
It is not a weakly prime, because it can be changed into another prime (101201022083879) 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, 50600511041904 + 50600511041905.
It is an arithmetic number, because the mean of its divisors is an integer number (50600511041905).
Almost surely, 2101201022083809 is an apocalyptic number.
It is an amenable number.
101201022083809 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201022083809 is an equidigital number, since it uses as much as digits as its factorization.
101201022083809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 37.
The spelling of 101201022083809 in words is "one hundred one trillion, two hundred one billion, twenty-two million, eighty-three thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •