Base | Representation |
---|---|
bin | 1011100111111001… |
… | …10011000110101001 |
3 | 121002220012022212021 |
4 | 11303330303012221 |
5 | 100240003110342 |
6 | 2511114544441 |
7 | 310432356004 |
oct | 56374630651 |
9 | 17086168767 |
10 | 6240285097 |
11 | 2712529612 |
12 | 1261a38121 |
13 | 785ab95b7 |
14 | 432aba53b |
15 | 267c9d567 |
hex | 173f331a9 |
6240285097 has 4 divisors (see below), whose sum is σ = 6240447360. Its totient is φ = 6240122836.
The previous prime is 6240285091. The next prime is 6240285109. The reversal of 6240285097 is 7905820426.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6240285097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6240285091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12828 + ... + 112450.
It is an arithmetic number, because the mean of its divisors is an integer number (1560111840).
Almost surely, 26240285097 is an apocalyptic number.
It is an amenable number.
6240285097 is a deficient number, since it is larger than the sum of its proper divisors (162263).
6240285097 is an equidigital number, since it uses as much as digits as its factorization.
6240285097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162262.
The product of its (nonzero) digits is 241920, while the sum is 43.
The square root of 6240285097 is about 78995.4751678854. The cubic root of 6240285097 is about 1841.0608541602.
The spelling of 6240285097 in words is "six billion, two hundred forty million, two hundred eighty-five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •