Base | Representation |
---|---|
bin | 1110111101000001… |
… | …0001010011011000 |
3 | 101100202002100000000 |
4 | 3233100101103120 |
5 | 31210042113200 |
6 | 1502150213000 |
7 | 201320414430 |
oct | 35720212330 |
9 | 11322070000 |
10 | 4014019800 |
11 | 177a89a53a |
12 | 940354160 |
13 | 4bc7bcb5b |
14 | 2a11632c0 |
15 | 1875e4300 |
hex | ef4114d8 |
4014019800 has 864 divisors, whose sum is σ = 17572089600. Its totient is φ = 831409920.
The previous prime is 4014019769. The next prime is 4014019811. The reversal of 4014019800 is 89104104.
It is a super-2 number, since 2×40140198002 = 32224709909584080000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 174522589 + ... + 174522611.
Almost surely, 24014019800 is an apocalyptic number.
4014019800 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 4014019800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8786044800).
4014019800 is an abundant number, since it is smaller than the sum of its proper divisors (13558069800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4014019800 is a wasteful number, since it uses less digits than its factorization.
4014019800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 4014019800 is about 63356.2925051648. The cubic root of 4014019800 is about 1589.2534765381.
The spelling of 4014019800 in words is "four billion, fourteen million, nineteen thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •