Base | Representation |
---|---|
bin | 110010000010011001… |
… | …1010101110101011101 |
3 | 101021100201001212211020 |
4 | 1210010303111311131 |
5 | 3230031404000140 |
6 | 121210344114353 |
7 | 10522554206436 |
oct | 1440463256535 |
9 | 337321055736 |
10 | 107454750045 |
11 | 41631450155 |
12 | 189aa4659b9 |
13 | a1960b6446 |
14 | 52b515448d |
15 | 2bdd92e6d0 |
hex | 1904cd5d5d |
107454750045 has 8 divisors (see below), whose sum is σ = 171927600096. Its totient is φ = 57309200016.
The previous prime is 107454750043. The next prime is 107454750071. The reversal of 107454750045 is 540057454701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 107454750045 - 21 = 107454750043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 107454749979 and 107454750006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107454750043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3581824987 + ... + 3581825016.
It is an arithmetic number, because the mean of its divisors is an integer number (21490950012).
Almost surely, 2107454750045 is an apocalyptic number.
107454750045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
107454750045 is a deficient number, since it is larger than the sum of its proper divisors (64472850051).
107454750045 is an equidigital number, since it uses as much as digits as its factorization.
107454750045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7163650011.
The product of its (nonzero) digits is 392000, while the sum is 42.
The spelling of 107454750045 in words is "one hundred seven billion, four hundred fifty-four million, seven hundred fifty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •