Base | Representation |
---|---|
bin | 1101110010111010… |
… | …01010010001000101 |
3 | 201010011102220221221 |
4 | 12321131022101011 |
5 | 110132014141420 |
6 | 3222532440341 |
7 | 351352221445 |
oct | 67135122105 |
9 | 21104386857 |
10 | 7406396485 |
11 | 3160799334 |
12 | 15284790b1 |
13 | 910576b37 |
14 | 503908125 |
15 | 2d5342caa |
hex | 1b974a445 |
7406396485 has 4 divisors (see below), whose sum is σ = 8887675788. Its totient is φ = 5925117184.
The previous prime is 7406396483. The next prime is 7406396489. The reversal of 7406396485 is 5846936047.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5846936047 = 1009 ⋅5794783.
It can be written as a sum of positive squares in 2 ways, for example, as 3566239524 + 3840156961 = 59718^2 + 61969^2 .
It is a cyclic number.
It is not a de Polignac number, because 7406396485 - 21 = 7406396483 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 (7406396483) 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, 740639644 + ... + 740639653.
It is an arithmetic number, because the mean of its divisors is an integer number (2221918947).
Almost surely, 27406396485 is an apocalyptic number.
It is an amenable number.
7406396485 is a deficient number, since it is larger than the sum of its proper divisors (1481279303).
7406396485 is a wasteful number, since it uses less digits than its factorization.
7406396485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1481279302.
The product of its (nonzero) digits is 4354560, while the sum is 52.
The square root of 7406396485 is about 86060.4234535248. The cubic root of 7406396485 is about 1949.2564761226.
The spelling of 7406396485 in words is "seven billion, four hundred six million, three hundred ninety-six thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •