Base | Representation |
---|---|
bin | 1111000110001010… |
… | …1001010111000111 |
3 | 101110102021210220011 |
4 | 3301202221113013 |
5 | 31244403010432 |
6 | 1510040451051 |
7 | 202264521043 |
oct | 36142512707 |
9 | 11412253804 |
10 | 4052391367 |
11 | 179a518682 |
12 | 951179a87 |
13 | 4c773641b |
14 | 2a62b1023 |
15 | 18ab73847 |
hex | f18a95c7 |
4052391367 has 8 divisors (see below), whose sum is σ = 4342869216. Its totient is φ = 3771437472.
The previous prime is 4052391361. The next prime is 4052391401. The reversal of 4052391367 is 7631932504.
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 4052391367 - 23 = 4052391359 is a prime.
It is a super-2 number, since 2×40523913672 = 32843751582672257378, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4052391361) 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 7 ways as a sum of consecutive naturals, for example, 2380108 + ... + 2381809.
It is an arithmetic number, because the mean of its divisors is an integer number (542858652).
Almost surely, 24052391367 is an apocalyptic number.
4052391367 is a deficient number, since it is larger than the sum of its proper divisors (290477849).
4052391367 is a wasteful number, since it uses less digits than its factorization.
4052391367 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4761977.
The product of its (nonzero) digits is 136080, while the sum is 40.
The square root of 4052391367 is about 63658.3958877382. The cubic root of 4052391367 is about 1594.3015212600.
The spelling of 4052391367 in words is "four billion, fifty-two million, three hundred ninety-one thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •