Base | Representation |
---|---|
bin | 1111000101110110… |
… | …1111000100011110 |
3 | 101110022212102000000 |
4 | 3301131233010132 |
5 | 31244040312110 |
6 | 1505553115130 |
7 | 202250546631 |
oct | 36135570436 |
9 | 11408772000 |
10 | 4051104030 |
11 | 1799819466 |
12 | 950858aa6 |
13 | 4c73a549c |
14 | 2a6057c18 |
15 | 18a9bc1c0 |
hex | f176f11e |
4051104030 has 56 divisors (see below), whose sum is σ = 10932999192. Its totient is φ = 1080292464.
The previous prime is 4051104017. The next prime is 4051104049. The reversal of 4051104030 is 304011504.
It is a happy number.
It is a super-2 number, since 2×40511040302 = 32822887723764481800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4051103994 and 4051104012.
It is a congruent number.
It is an unprimeable number.
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 27 ways as a sum of consecutive naturals, for example, 270564 + ... + 285143.
Almost surely, 24051104030 is an apocalyptic number.
4051104030 is an abundant number, since it is smaller than the sum of its proper divisors (6881895162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4051104030 is an equidigital number, since it uses as much as digits as its factorization.
4051104030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555732 (or 555717 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 4051104030 is about 63648.2837946162. The cubic root of 4051104030 is about 1594.1326809777.
Adding to 4051104030 its reverse (304011504), we get a palindrome (4355115534).
The spelling of 4051104030 in words is "four billion, fifty-one million, one hundred four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •