Base | Representation |
---|---|
bin | 10110111101011000111111… |
… | …101010100111010001101011 |
3 | 111020112012001120200221121112 |
4 | 112331120333222213101223 |
5 | 101213341313302430431 |
6 | 554431341355500535 |
7 | 30161154125063423 |
oct | 2675307752472153 |
9 | 436465046627545 |
10 | 100975749264491 |
11 | 2a1a06360335a2 |
12 | b3a993a15774b |
13 | 4445c841a603a |
14 | 1ad13765d1483 |
15 | ba1927017c2b |
hex | 5bd63faa746b |
100975749264491 has 2 divisors, whose sum is σ = 100975749264492. Its totient is φ = 100975749264490.
The previous prime is 100975749264451. The next prime is 100975749264493. The reversal of 100975749264491 is 194462947579001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100975749264491 is a prime.
It is a super-2 number, since 2×1009757492644912 (a number of 29 digits) contains 22 as substring.
Together with 100975749264493, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (100975749264493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50487874632245 + 50487874632246.
It is an arithmetic number, because the mean of its divisors is an integer number (50487874632246).
Almost surely, 2100975749264491 is an apocalyptic number.
100975749264491 is a deficient number, since it is larger than the sum of its proper divisors (1).
100975749264491 is an equidigital number, since it uses as much as digits as its factorization.
100975749264491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 137168640, while the sum is 68.
The spelling of 100975749264491 in words is "one hundred trillion, nine hundred seventy-five billion, seven hundred forty-nine million, two hundred sixty-four thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.336 sec. • engine limits •