Base | Representation |
---|---|
bin | 11110000100100100… |
… | …00011100101000001 |
3 | 1112200010120020222211 |
4 | 33002102003211001 |
5 | 231030432240131 |
6 | 11225554502121 |
7 | 1111034156266 |
oct | 170222034501 |
9 | 45603506884 |
10 | 16144415041 |
11 | 6935112a77 |
12 | 3166894941 |
13 | 16a397b011 |
14 | ad220526d |
15 | 6475205b1 |
hex | 3c2483941 |
16144415041 has 8 divisors (see below), whose sum is σ = 17168737320. Its totient is φ = 15128387328.
The previous prime is 16144415039. The next prime is 16144415117. The reversal of 16144415041 is 14051444161.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3844496016 + 12299919025 = 62004^2 + 110905^2 .
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 16144415041 - 21 = 16144415039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16144414994 and 16144415012.
It is not an unprimeable number, because it can be changed into a prime (16144415141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2069626 + ... + 2077411.
It is an arithmetic number, because the mean of its divisors is an integer number (2146092165).
Almost surely, 216144415041 is an apocalyptic number.
It is an amenable number.
16144415041 is a deficient number, since it is larger than the sum of its proper divisors (1024322279).
16144415041 is a wasteful number, since it uses less digits than its factorization.
16144415041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4147283.
The product of its (nonzero) digits is 7680, while the sum is 31.
The spelling of 16144415041 in words is "sixteen billion, one hundred forty-four million, four hundred fifteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •