Base | Representation |
---|---|
bin | 1110111110011110… |
… | …0000001101111100 |
3 | 101101011112202110112 |
4 | 3233213200031330 |
5 | 31213122011304 |
6 | 1502524525152 |
7 | 201423241625 |
oct | 35747401574 |
9 | 11334482415 |
10 | 4020110204 |
11 | 178327a330 |
12 | 9423b07b8 |
13 | 4c0b43046 |
14 | 2a1caaa4c |
15 | 187de8b6e |
hex | ef9e037c |
4020110204 has 24 divisors (see below), whose sum is σ = 7696902528. Its totient is φ = 1822049840.
The previous prime is 4020110201. The next prime is 4020110233.
4020110204 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×40201102042 = 32322572104609843232, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4020110201) 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, 116384 + ... + 146919.
It is an arithmetic number, because the mean of its divisors is an integer number (320704272).
Almost surely, 24020110204 is an apocalyptic number.
4020110204 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
4020110204 is a deficient number, since it is larger than the sum of its proper divisors (3676792324).
4020110204 is a wasteful number, since it uses less digits than its factorization.
4020110204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263665 (or 263663 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 4020110204 is about 63404.3389997877. The cubic root of 4020110204 is about 1590.0568527856.
It can be divided in two parts, 40201 and 10204, that added together give a palindrome (50405).
The spelling of 4020110204 in words is "four billion, twenty million, one hundred ten thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •