Base | Representation |
---|---|
bin | 1110101010100010100000… |
… | …0110010011011000010011 |
3 | 2010002102210212221211202211 |
4 | 3222220220012103120103 |
5 | 4103133402333020232 |
6 | 54143130521052551 |
7 | 3252630153252244 |
oct | 352505006233023 |
9 | 63072725854684 |
10 | 16123979970067 |
11 | 5157161383a52 |
12 | 1984b28327157 |
13 | 8cc63c100148 |
14 | 3da594a82ccb |
15 | 1ce64d49ba47 |
hex | eaa28193613 |
16123979970067 has 4 divisors (see below), whose sum is σ = 16124866847056. Its totient is φ = 16123093093080.
The previous prime is 16123979970037. The next prime is 16123979970071. The reversal of 16123979970067 is 76007997932161.
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-16123979970067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16123979969984 and 16123979970011.
It is not an unprimeable number, because it can be changed into a prime (16123979970037) 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 3 ways as a sum of consecutive naturals, for example, 443411223 + ... + 443447584.
It is an arithmetic number, because the mean of its divisors is an integer number (4031216711764).
Almost surely, 216123979970067 is an apocalyptic number.
16123979970067 is a deficient number, since it is larger than the sum of its proper divisors (886876989).
16123979970067 is an equidigital number, since it uses as much as digits as its factorization.
16123979970067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886876988.
The product of its (nonzero) digits is 54010152, while the sum is 67.
The spelling of 16123979970067 in words is "sixteen trillion, one hundred twenty-three billion, nine hundred seventy-nine million, nine hundred seventy thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •