Base | Representation |
---|---|
bin | 111010110010100110000… |
… | …110101000101100101101 |
3 | 112022020002110011010110202 |
4 | 322302212012220230231 |
5 | 1012143013320000121 |
6 | 12331550501243245 |
7 | 564612232344641 |
oct | 72624606505455 |
9 | 15266073133422 |
10 | 4040056015661 |
11 | 131841832a046 |
12 | 552ba6703525 |
13 | 233c8b661553 |
14 | dd77b12cc21 |
15 | 7015785940b |
hex | 3aca61a8b2d |
4040056015661 has 2 divisors, whose sum is σ = 4040056015662. Its totient is φ = 4040056015660.
The previous prime is 4040056015627. The next prime is 4040056015663. The reversal of 4040056015661 is 1665106500404.
It is a happy number.
4040056015661 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., 3390363594436 + 649692421225 = 1841294^2 + 806035^2 .
It is a cyclic number.
It is not a de Polignac number, because 4040056015661 - 222 = 4040051821357 is a prime.
Together with 4040056015663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4040056015663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2020028007830 + 2020028007831.
It is an arithmetic number, because the mean of its divisors is an integer number (2020028007831).
Almost surely, 24040056015661 is an apocalyptic number.
It is an amenable number.
4040056015661 is a deficient number, since it is larger than the sum of its proper divisors (1).
4040056015661 is an equidigital number, since it uses as much as digits as its factorization.
4040056015661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 4040056015661 in words is "four trillion, forty billion, fifty-six million, fifteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •