Base | Representation |
---|---|
bin | 1000001101000000… |
… | …01011001011110101 |
3 | 102100221000200110000 |
4 | 10012200023023311 |
5 | 33004420040023 |
6 | 2005002221513 |
7 | 214064635455 |
oct | 40640131365 |
9 | 12327020400 |
10 | 4404065013 |
11 | 195aa86257 |
12 | a2aab4899 |
13 | 55255733a |
14 | 2dac95d65 |
15 | 1ab98d243 |
hex | 10680b2f5 |
4404065013 has 10 divisors (see below), whose sum is σ = 6578912054. Its totient is φ = 2936043288.
The previous prime is 4404065011. The next prime is 4404065021. The reversal of 4404065013 is 3105604044.
4404065013 is a `hidden beast` number, since 4 + 4 + 0 + 4 + 0 + 650 + 1 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 3944091204 + 459973809 = 62802^2 + 21447^2 .
It is not a de Polignac number, because 4404065013 - 21 = 4404065011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4404065011) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 27185506 + ... + 27185667.
Almost surely, 24404065013 is an apocalyptic number.
It is an amenable number.
4404065013 is a deficient number, since it is larger than the sum of its proper divisors (2174847041).
4404065013 is an equidigital number, since it uses as much as digits as its factorization.
4404065013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54371185 (or 54371176 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 4404065013 is about 66363.1299216666. The cubic root of 4404065013 is about 1639.1470149105.
Adding to 4404065013 its reverse (3105604044), we get a palindrome (7509669057).
The spelling of 4404065013 in words is "four billion, four hundred four million, sixty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •