Base | Representation |
---|---|
bin | 111100100111010011110… |
… | …001111101101100001011 |
3 | 112202012120020120021102011 |
4 | 330213103301331230023 |
5 | 1021221142324301024 |
6 | 12505314132120351 |
7 | 606636624134233 |
oct | 74472361755413 |
9 | 15665506507364 |
10 | 4165376400139 |
11 | 1366587428829 |
12 | 5733401660b7 |
13 | 242a40b916c6 |
14 | 105868cd4cc3 |
15 | 7353e950094 |
hex | 3c9d3c7db0b |
4165376400139 has 8 divisors (see below), whose sum is σ = 4278480494400. Its totient is φ = 4053770373576.
The previous prime is 4165376400127. The next prime is 4165376400293. The reversal of 4165376400139 is 9310046735614.
4165376400139 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4165376400139 - 29 = 4165376399627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4165376400092 and 4165376400101.
It is not an unprimeable number, because it can be changed into a prime (4165376400539) 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, 374511289 + ... + 374522410.
It is an arithmetic number, because the mean of its divisors is an integer number (534810061800).
Almost surely, 24165376400139 is an apocalyptic number.
4165376400139 is a deficient number, since it is larger than the sum of its proper divisors (113104094261).
4165376400139 is an equidigital number, since it uses as much as digits as its factorization.
4165376400139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 749033849.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 4165376400139 in words is "four trillion, one hundred sixty-five billion, three hundred seventy-six million, four hundred thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •