Base | Representation |
---|---|
bin | 11000010111111010000010… |
… | …010010110101010010111101 |
3 | 112001112211120010202020221012 |
4 | 120113322002102311102331 |
5 | 103022244331303423131 |
6 | 1015553053034245005 |
7 | 31402440210605645 |
oct | 3027720222652275 |
9 | 461484503666835 |
10 | 107195979748541 |
11 | 31179617a7a252 |
12 | 10033370886765 |
13 | 47a76cabcb308 |
14 | 1c68455223525 |
15 | c5d63051c52b |
hex | 617e824b54bd |
107195979748541 has 2 divisors, whose sum is σ = 107195979748542. Its totient is φ = 107195979748540.
The previous prime is 107195979748397. The next prime is 107195979748567. The reversal of 107195979748541 is 145847979591701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103037015011225 + 4158964737316 = 10150715^2 + 2039354^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107195979748541 is a prime.
It is a super-2 number, since 2×1071959797485412 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107195979148541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53597989874270 + 53597989874271.
It is an arithmetic number, because the mean of its divisors is an integer number (53597989874271).
Almost surely, 2107195979748541 is an apocalyptic number.
It is an amenable number.
107195979748541 is a deficient number, since it is larger than the sum of its proper divisors (1).
107195979748541 is an equidigital number, since it uses as much as digits as its factorization.
107195979748541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 800150400, while the sum is 77.
The spelling of 107195979748541 in words is "one hundred seven trillion, one hundred ninety-five billion, nine hundred seventy-nine million, seven hundred forty-eight thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •