Base | Representation |
---|---|
bin | 1110111111111001… |
… | …1001000111000001 |
3 | 101101120211121012001 |
4 | 3233332121013001 |
5 | 31221141013101 |
6 | 1503301304001 |
7 | 201525242125 |
oct | 35776310701 |
9 | 11346747161 |
10 | 4026110401 |
11 | 17866a8375 |
12 | 944405001 |
13 | 4c2164161 |
14 | 2a29cd585 |
15 | 1886d1901 |
hex | eff991c1 |
4026110401 has 2 divisors, whose sum is σ = 4026110402. Its totient is φ = 4026110400.
The previous prime is 4026110383. The next prime is 4026110411. The reversal of 4026110401 is 1040116204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3297056400 + 729054001 = 57420^2 + 27001^2 .
It is a cyclic number.
It is not a de Polignac number, because 4026110401 - 219 = 4025586113 is a prime.
It is a super-2 number, since 2×40261104012 = 32419129922080761602, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4026110411) 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, 2013055200 + 2013055201.
It is an arithmetic number, because the mean of its divisors is an integer number (2013055201).
Almost surely, 24026110401 is an apocalyptic number.
It is an amenable number.
4026110401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4026110401 is an equidigital number, since it uses as much as digits as its factorization.
4026110401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 4026110401 is about 63451.6382846022. The cubic root of 4026110401 is about 1590.8475368868.
Adding to 4026110401 its reverse (1040116204), we get a palindrome (5066226605).
The spelling of 4026110401 in words is "four billion, twenty-six million, one hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •