Base | Representation |
---|---|
bin | 10001101010110101… |
… | …01111111010100010 |
3 | 220111002211210102001 |
4 | 20311122233322202 |
5 | 123411422422132 |
6 | 4205144514214 |
7 | 454034565022 |
oct | 106532577242 |
9 | 26432753361 |
10 | 9486139042 |
11 | 4028750736 |
12 | 1a08a7b96a |
13 | b823c1333 |
14 | 65dbdda82 |
15 | 3a7c07ce7 |
hex | 2356afea2 |
9486139042 has 4 divisors (see below), whose sum is σ = 14229208566. Its totient is φ = 4743069520.
The previous prime is 9486139001. The next prime is 9486139049. The reversal of 9486139042 is 2409316849.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 2409316849 = 167 ⋅14427047.
It can be written as a sum of positive squares in only one way, i.e., 4867713361 + 4618425681 = 69769^2 + 67959^2 .
It is a junction number, because it is equal to n+sod(n) for n = 9486138983 and 9486139001.
It is not an unprimeable number, because it can be changed into a prime (9486139049) 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 as a sum of consecutive naturals, namely, 2371534759 + ... + 2371534762.
Almost surely, 29486139042 is an apocalyptic number.
9486139042 is a deficient number, since it is larger than the sum of its proper divisors (4743069524).
9486139042 is a wasteful number, since it uses less digits than its factorization.
9486139042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4743069523.
The product of its (nonzero) digits is 373248, while the sum is 46.
The square root of 9486139042 is about 97396.8122784314. The cubic root of 9486139042 is about 2116.8812456224.
It can be divided in two parts, 94861 and 39042, that added together give a triangular number (133903 = T517).
The spelling of 9486139042 in words is "nine billion, four hundred eighty-six million, one hundred thirty-nine thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •