Base | Representation |
---|---|
bin | 1011111111110100… |
… | …11000001011111001 |
3 | 121121212211112121002 |
4 | 11333322120023321 |
5 | 101142342232040 |
6 | 2543044254345 |
7 | 315420255011 |
oct | 57772301371 |
9 | 17555745532 |
10 | 6440977145 |
11 | 2805844509 |
12 | 12b90a13b5 |
13 | 7b85568a5 |
14 | 4515dcc41 |
15 | 27a6e2a15 |
hex | 17fe982f9 |
6440977145 has 8 divisors (see below), whose sum is σ = 7741703304. Its totient is φ = 5144427904.
The previous prime is 6440977141. The next prime is 6440977171. The reversal of 6440977145 is 5417790446.
It can be written as a sum of positive squares in 4 ways, for example, as 421234576 + 6019742569 = 20524^2 + 77587^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 6440977145 - 22 = 6440977141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 6440977145.
It is not an unprimeable number, because it can be changed into a prime (6440977141) 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, 1040834 + ... + 1047003.
It is an arithmetic number, because the mean of its divisors is an integer number (967712913).
Almost surely, 26440977145 is an apocalyptic number.
It is an amenable number.
6440977145 is a deficient number, since it is larger than the sum of its proper divisors (1300726159).
6440977145 is a wasteful number, since it uses less digits than its factorization.
6440977145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2088459.
The product of its (nonzero) digits is 846720, while the sum is 47.
The square root of 6440977145 is about 80255.6985204166. The cubic root of 6440977145 is about 1860.5895869576.
The spelling of 6440977145 in words is "six billion, four hundred forty million, nine hundred seventy-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •