Base | Representation |
---|---|
bin | 1110111100010011… |
… | …0110001001101000 |
3 | 101100112110011220111 |
4 | 3233010312021220 |
5 | 31203310300000 |
6 | 1502002104104 |
7 | 201253102303 |
oct | 35704661150 |
9 | 11315404814 |
10 | 4011025000 |
11 | 17791344a4 |
12 | 93b34b034 |
13 | 4bbcb1998 |
14 | 2a09c3b3a |
15 | 187201cba |
hex | ef136268 |
4011025000 has 48 divisors (see below), whose sum is σ = 9400296780. Its totient is φ = 1604400000.
The previous prime is 4011024989. The next prime is 4011025013. The reversal of 4011025000 is 5201104.
4011025000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 842724 + 4010182276 = 918^2 + 63326^2 .
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, 55221 + ... + 105220.
Almost surely, 24011025000 is an apocalyptic number.
4011025000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4011025000 is an abundant number, since it is smaller than the sum of its proper divisors (5389271780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4011025000 is an equidigital number, since it uses as much as digits as its factorization.
4011025000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160472 (or 160448 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 4011025000 is about 63332.6535051232. The cubic root of 4011025000 is about 1588.8581388050.
Adding to 4011025000 its reverse (5201104), we get a palindrome (4016226104).
It can be divided in two parts, 40 and 11025000, that multiplied together give a square (441000000 = 210002).
The spelling of 4011025000 in words is "four billion, eleven million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •