Base | Representation |
---|---|
bin | 10110111111010101011001… |
… | …010111001001011001111111 |
3 | 111020222221211122210121201022 |
4 | 112333111121113021121333 |
5 | 101223033344013331244 |
6 | 555012552105334355 |
7 | 30203623212445646 |
oct | 2677253127113177 |
9 | 436887748717638 |
10 | 101109324355199 |
11 | 2a242250758246 |
12 | b40b7b81973bb |
13 | 4455750948b54 |
14 | 1ad7a0880435d |
15 | ba5143b6c6ee |
hex | 5bf5595c967f |
101109324355199 has 2 divisors, whose sum is σ = 101109324355200. Its totient is φ = 101109324355198.
The previous prime is 101109324355141. The next prime is 101109324355201. The reversal of 101109324355199 is 991553423901101.
It is a strong prime.
It is an emirp because it is prime and its reverse (991553423901101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101109324355199 - 224 = 101109307577983 is a prime.
Together with 101109324355201, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101109324355199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101109324355129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50554662177599 + 50554662177600.
It is an arithmetic number, because the mean of its divisors is an integer number (50554662177600).
Almost surely, 2101109324355199 is an apocalyptic number.
101109324355199 is a deficient number, since it is larger than the sum of its proper divisors (1).
101109324355199 is an equidigital number, since it uses as much as digits as its factorization.
101109324355199 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1312200, while the sum is 53.
The spelling of 101109324355199 in words is "one hundred one trillion, one hundred nine billion, three hundred twenty-four million, three hundred fifty-five thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •