Base | Representation |
---|---|
bin | 1110111111111000… |
… | …1101001011101111 |
3 | 101101120202010011210 |
4 | 3233332031023233 |
5 | 31221132432201 |
6 | 1503300245503 |
7 | 201524646531 |
oct | 35776151357 |
9 | 11346663153 |
10 | 4026061551 |
11 | 17866746a6 |
12 | 9443a0893 |
13 | 4c2147b55 |
14 | 2a29b9851 |
15 | 1886c21d6 |
hex | eff8d2ef |
4026061551 has 8 divisors (see below), whose sum is σ = 5400226944. Its totient is φ = 2667968600.
The previous prime is 4026061493. The next prime is 4026061573. The reversal of 4026061551 is 1551606204.
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 4026061551 - 210 = 4026060527 is a prime.
It is a super-2 number, since 2×40260615512 = 32418343224881051202, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4026065551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4017525 + ... + 4018526.
It is an arithmetic number, because the mean of its divisors is an integer number (675028368).
Almost surely, 24026061551 is an apocalyptic number.
4026061551 is a deficient number, since it is larger than the sum of its proper divisors (1374165393).
4026061551 is a wasteful number, since it uses less digits than its factorization.
4026061551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8036221.
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 4026061551 is about 63451.2533445952. The cubic root of 4026061551 is about 1590.8411027847.
Adding to 4026061551 its reverse (1551606204), we get a palindrome (5577667755).
The spelling of 4026061551 in words is "four billion, twenty-six million, sixty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •