Base | Representation |
---|---|
bin | 111010110011001010111… |
… | …010110100000110001001 |
3 | 112022021200111101101220001 |
4 | 322303022322310012021 |
5 | 1012200244430023414 |
6 | 12332132044003001 |
7 | 564633442346656 |
oct | 72631272640611 |
9 | 15267614341801 |
10 | 4040673673609 |
11 | 1318704a48661 |
12 | 553139530461 |
13 | 234059600521 |
14 | dd7d9190c2d |
15 | 70191bb4074 |
hex | 3accaeb4189 |
4040673673609 has 2 divisors, whose sum is σ = 4040673673610. Its totient is φ = 4040673673608.
The previous prime is 4040673673529. The next prime is 4040673673681. The reversal of 4040673673609 is 9063763760404.
4040673673609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3573839011600 + 466834662009 = 1890460^2 + 683253^2 .
It is a cyclic number.
It is not a de Polignac number, because 4040673673609 - 27 = 4040673673481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4040673673609.
It is not a weakly prime, because it can be changed into another prime (4040673673009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2020336836804 + 2020336836805.
It is an arithmetic number, because the mean of its divisors is an integer number (2020336836805).
Almost surely, 24040673673609 is an apocalyptic number.
It is an amenable number.
4040673673609 is a deficient number, since it is larger than the sum of its proper divisors (1).
4040673673609 is an equidigital number, since it uses as much as digits as its factorization.
4040673673609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13716864, while the sum is 55.
The spelling of 4040673673609 in words is "four trillion, forty billion, six hundred seventy-three million, six hundred seventy-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •