Base | Representation |
---|---|
bin | 1101110011000111… |
… | …10001100100100110 |
3 | 201010021201000100212 |
4 | 12321203301210212 |
5 | 110132440132332 |
6 | 3223033535422 |
7 | 351403032434 |
oct | 67143614446 |
9 | 21107630325 |
10 | 7408130342 |
11 | 3161772a78 |
12 | 1528b74572 |
13 | 910a330a2 |
14 | 503c39d54 |
15 | 2d55868b2 |
hex | 1b98f1926 |
7408130342 has 8 divisors (see below), whose sum is σ = 11153505600. Its totient is φ = 3690295144.
The previous prime is 7408130339. The next prime is 7408130347. The reversal of 7408130342 is 2430318047.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×74081303422 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7408130299 and 7408130308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7408130347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6884342 + ... + 6885417.
It is an arithmetic number, because the mean of its divisors is an integer number (1394188200).
Almost surely, 27408130342 is an apocalyptic number.
7408130342 is a deficient number, since it is larger than the sum of its proper divisors (3745375258).
7408130342 is a wasteful number, since it uses less digits than its factorization.
7408130342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13770030.
The product of its (nonzero) digits is 16128, while the sum is 32.
The square root of 7408130342 is about 86070.4963503755. The cubic root of 7408130342 is about 1949.4085729528.
Adding to 7408130342 its reverse (2430318047), we get a palindrome (9838448389).
The spelling of 7408130342 in words is "seven billion, four hundred eight million, one hundred thirty thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •