Base | Representation |
---|---|
bin | 110111111011011000… |
… | …0110011101101000111 |
3 | 102111000021001210012201 |
4 | 1233312300303231013 |
5 | 3431433122404243 |
6 | 131101451455331 |
7 | 11451202030561 |
oct | 1576660635507 |
9 | 374007053181 |
10 | 120104106823 |
11 | 46a32701118 |
12 | 1b33a757547 |
13 | b43093823c |
14 | 5b550c6331 |
15 | 31ce1bc04d |
hex | 1bf6c33b47 |
120104106823 has 4 divisors (see below), whose sum is σ = 120495325720. Its totient is φ = 119712887928.
The previous prime is 120104106779. The next prime is 120104106841. The reversal of 120104106823 is 328601401021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120104106823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120104106791 and 120104106800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120104109823) 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, 195608988 + ... + 195609601.
It is an arithmetic number, because the mean of its divisors is an integer number (30123831430).
Almost surely, 2120104106823 is an apocalyptic number.
120104106823 is a deficient number, since it is larger than the sum of its proper divisors (391218897).
120104106823 is an equidigital number, since it uses as much as digits as its factorization.
120104106823 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391218896.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 120104106823 its reverse (328601401021), we get a palindrome (448705507844).
The spelling of 120104106823 in words is "one hundred twenty billion, one hundred four million, one hundred six thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •