Base | Representation |
---|---|
bin | 1001111100101000… |
… | …10101101001100110 |
3 | 111210012001210212220 |
4 | 10332110111221212 |
5 | 41414131024441 |
6 | 2241533053210 |
7 | 246225245514 |
oct | 47624255146 |
9 | 14705053786 |
10 | 5340486246 |
11 | 22a06243a7 |
12 | 1050627206 |
13 | 671563644 |
14 | 3893b34b4 |
15 | 213cb1466 |
hex | 13e515a66 |
5340486246 has 8 divisors (see below), whose sum is σ = 10680972504. Its totient is φ = 1780162080.
The previous prime is 5340486241. The next prime is 5340486253. The reversal of 5340486246 is 6426840435.
It is a sphenic number, since it is the product of 3 distinct primes.
5340486246 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 5340486198 and 5340486207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5340486241) 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, 445040515 + ... + 445040526.
It is an arithmetic number, because the mean of its divisors is an integer number (1335121563).
Almost surely, 25340486246 is an apocalyptic number.
5340486246 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5340486246 is a wasteful number, since it uses less digits than its factorization.
5340486246 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890081046.
The product of its (nonzero) digits is 552960, while the sum is 42.
The square root of 5340486246 is about 73078.6305700921. The cubic root of 5340486246 is about 1747.9416611414.
The spelling of 5340486246 in words is "five billion, three hundred forty million, four hundred eighty-six thousand, two hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •