Base | Representation |
---|---|
bin | 1110111110011110… |
… | …0001000011000000 |
3 | 101101011112221010022 |
4 | 3233213201003000 |
5 | 31213122113400 |
6 | 1502524553012 |
7 | 201423254546 |
oct | 35747410300 |
9 | 11334487108 |
10 | 4020113600 |
11 | 1783281938 |
12 | 9423b2768 |
13 | 4c0b44759 |
14 | 2a1cabd96 |
15 | 187de9b85 |
hex | ef9e10c0 |
4020113600 has 84 divisors (see below), whose sum is σ = 10078845984. Its totient is φ = 1577671680.
The previous prime is 4020113599. The next prime is 4020113611. The reversal of 4020113600 is 63110204.
It is a super-2 number, since 2×40201136002 = 32322626713809920000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61097 + ... + 108503.
Almost surely, 24020113600 is an apocalyptic number.
4020113600 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4020113600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5039422992).
4020113600 is an abundant number, since it is smaller than the sum of its proper divisors (6058732384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4020113600 is a wasteful number, since it uses less digits than its factorization.
4020113600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47482 (or 47467 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 4020113600 is about 63404.3657802836. The cubic root of 4020113600 is about 1590.0573005206.
Adding to 4020113600 its reverse (63110204), we get a palindrome (4083223804).
The spelling of 4020113600 in words is "four billion, twenty million, one hundred thirteen thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •