Base | Representation |
---|---|
bin | 1011100111111101… |
… | …10010110010110101 |
3 | 121002221011220022101 |
4 | 11303332302302311 |
5 | 100240121324432 |
6 | 2511134102101 |
7 | 310436664565 |
oct | 56376626265 |
9 | 17087156271 |
10 | 6240808117 |
11 | 2712856565 |
12 | 126204a931 |
13 | 785c4068b |
14 | 432bb4da5 |
15 | 267d534e7 |
hex | 173fb2cb5 |
6240808117 has 4 divisors (see below), whose sum is σ = 6241438476. Its totient is φ = 6240177760.
The previous prime is 6240808051. The next prime is 6240808159. The reversal of 6240808117 is 7118080426.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7118080426 = 2 ⋅3559040213.
It can be written as a sum of positive squares in 2 ways, for example, as 4783935556 + 1456872561 = 69166^2 + 38169^2 .
It is a cyclic number.
It is not a de Polignac number, because 6240808117 - 215 = 6240775349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6240805117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300088 + ... + 320209.
It is an arithmetic number, because the mean of its divisors is an integer number (1560359619).
Almost surely, 26240808117 is an apocalyptic number.
It is an amenable number.
6240808117 is a deficient number, since it is larger than the sum of its proper divisors (630359).
6240808117 is a wasteful number, since it uses less digits than its factorization.
6240808117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630358.
The product of its (nonzero) digits is 21504, while the sum is 37.
The square root of 6240808117 is about 78998.7855412980. The cubic root of 6240808117 is about 1841.1122879613.
The spelling of 6240808117 in words is "six billion, two hundred forty million, eight hundred eight thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •