Base | Representation |
---|---|
bin | 110111100111001100… |
… | …1011111001111010111 |
3 | 102102021001210101000110 |
4 | 1233032121133033113 |
5 | 3424041241430142 |
6 | 130510341014103 |
7 | 11425336641432 |
oct | 1571631371727 |
9 | 372231711013 |
10 | 119426905047 |
11 | 4671541342a |
12 | 1b18b9b4333 |
13 | b35354bb28 |
14 | 5acd1a4819 |
15 | 318e9ee99c |
hex | 1bce65f3d7 |
119426905047 has 8 divisors (see below), whose sum is σ = 159615912960. Its totient is φ = 79427916920.
The previous prime is 119426905021. The next prime is 119426905049. The reversal of 119426905047 is 740509624911.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 119426905047 - 211 = 119426902999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 119426904987 and 119426905005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119426905049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47503479 + ... + 47505992.
It is an arithmetic number, because the mean of its divisors is an integer number (19951989120).
Almost surely, 2119426905047 is an apocalyptic number.
119426905047 is a deficient number, since it is larger than the sum of its proper divisors (40189007913).
119426905047 is an equidigital number, since it uses as much as digits as its factorization.
119426905047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95009893.
The product of its (nonzero) digits is 544320, while the sum is 48.
The spelling of 119426905047 in words is "one hundred nineteen billion, four hundred twenty-six million, nine hundred five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •