Base | Representation |
---|---|
bin | 110010010000110110… |
… | …0010000110010000001 |
3 | 101022121111002100200001 |
4 | 1210201230100302001 |
5 | 3232024443333401 |
6 | 121330420400001 |
7 | 10540561022146 |
oct | 1444154206201 |
9 | 338544070601 |
10 | 107939433601 |
11 | 4185aaa607a |
12 | 18b04846001 |
13 | a242637b4c |
14 | 531d6803cd |
15 | 2c1b26e601 |
hex | 1921b10c81 |
107939433601 has 4 divisors (see below), whose sum is σ = 108048354304. Its totient is φ = 107830512900.
The previous prime is 107939433587. The next prime is 107939433643. The reversal of 107939433601 is 106334939701.
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 a de Polignac number, because none of the positive numbers 2k-107939433601 is a prime.
It is a super-2 number, since 2×1079394336012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (107939433401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54458865 + ... + 54460846.
It is an arithmetic number, because the mean of its divisors is an integer number (27012088576).
Almost surely, 2107939433601 is an apocalyptic number.
It is an amenable number.
107939433601 is a deficient number, since it is larger than the sum of its proper divisors (108920703).
107939433601 is an equidigital number, since it uses as much as digits as its factorization.
107939433601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108920702.
The product of its (nonzero) digits is 367416, while the sum is 46.
The spelling of 107939433601 in words is "one hundred seven billion, nine hundred thirty-nine million, four hundred thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •