Base | Representation |
---|---|
bin | 110010111100111100… |
… | …1011010011100111101 |
3 | 101110102121200010221020 |
4 | 1211321321122130331 |
5 | 3243042313313333 |
6 | 122133322454353 |
7 | 10622340333561 |
oct | 1457171323475 |
9 | 343377603836 |
10 | 109419276093 |
11 | 4244a3686a6 |
12 | 192583643b9 |
13 | a41a0c00aa |
14 | 54200176a1 |
15 | 2ca61363b3 |
hex | 1979e5a73d |
109419276093 has 4 divisors (see below), whose sum is σ = 145892368128. Its totient is φ = 72946184060.
The previous prime is 109419276037. The next prime is 109419276097. The reversal of 109419276093 is 390672914901.
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.
It is a cyclic number.
It is not a de Polignac number, because 109419276093 - 226 = 109352167229 is a prime.
It is a super-2 number, since 2×1094192760932 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109419276097) 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 in 3 ways as a sum of consecutive naturals, for example, 18236546013 + ... + 18236546018.
It is an arithmetic number, because the mean of its divisors is an integer number (36473092032).
Almost surely, 2109419276093 is an apocalyptic number.
It is an amenable number.
109419276093 is a deficient number, since it is larger than the sum of its proper divisors (36473092035).
109419276093 is an equidigital number, since it uses as much as digits as its factorization.
109419276093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36473092034.
The product of its (nonzero) digits is 734832, while the sum is 51.
The spelling of 109419276093 in words is "one hundred nine billion, four hundred nineteen million, two hundred seventy-six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •