Base | Representation |
---|---|
bin | 1111001101110110… |
… | …1100100011001101 |
3 | 101112122222121212111 |
4 | 3303131230203031 |
5 | 31331132220031 |
6 | 1513152104021 |
7 | 203135636110 |
oct | 36335544315 |
9 | 11478877774 |
10 | 4084648141 |
11 | 180674a672 |
12 | 95bb35011 |
13 | 50131b682 |
14 | 2aa6aa577 |
15 | 18d8e61b1 |
hex | f376c8cd |
4084648141 has 8 divisors (see below), whose sum is σ = 4677344640. Its totient is φ = 3494245488.
The previous prime is 4084648111. The next prime is 4084648151. The reversal of 4084648141 is 1418464804.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4084648141 - 25 = 4084648109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4084648094 and 4084648103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4084648111) 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 7 ways as a sum of consecutive naturals, for example, 569641 + ... + 576766.
It is an arithmetic number, because the mean of its divisors is an integer number (584668080).
Almost surely, 24084648141 is an apocalyptic number.
It is an amenable number.
4084648141 is a deficient number, since it is larger than the sum of its proper divisors (592696499).
4084648141 is a wasteful number, since it uses less digits than its factorization.
4084648141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1146923.
The product of its (nonzero) digits is 98304, while the sum is 40.
The square root of 4084648141 is about 63911.2520687868. The cubic root of 4084648141 is about 1598.5205257535.
The spelling of 4084648141 in words is "four billion, eighty-four million, six hundred forty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •