Base | Representation |
---|---|
bin | 110000111011100010… |
… | …0110101000111110101 |
3 | 101001012222212010202122 |
4 | 1201313010311013311 |
5 | 3210144201014343 |
6 | 120134404045325 |
7 | 10406622336143 |
oct | 1416704650765 |
9 | 331188763678 |
10 | 105076969973 |
11 | 40621234858 |
12 | 18446093845 |
13 | 9ba75aa4a1 |
14 | 512b43a593 |
15 | 2aeece7068 |
hex | 18771351f5 |
105076969973 has 4 divisors (see below), whose sum is σ = 105158870688. Its totient is φ = 104995069260.
The previous prime is 105076969957. The next prime is 105076969981. The reversal of 105076969973 is 379969670501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 379969670501 = 9629 ⋅39460969.
It is a cyclic number.
It is not a de Polignac number, because 105076969973 - 24 = 105076969957 is a prime.
It is a super-2 number, since 2×1050769699732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105076969993) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40948433 + ... + 40950998.
It is an arithmetic number, because the mean of its divisors is an integer number (26289717672).
Almost surely, 2105076969973 is an apocalyptic number.
It is an amenable number.
105076969973 is a deficient number, since it is larger than the sum of its proper divisors (81900715).
105076969973 is an equidigital number, since it uses as much as digits as its factorization.
105076969973 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81900714.
The product of its (nonzero) digits is 19289340, while the sum is 62.
The spelling of 105076969973 in words is "one hundred five billion, seventy-six million, nine hundred sixty-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •