Base | Representation |
---|---|
bin | 1111000101011001… |
… | …1110010011110000 |
3 | 101110012021200200000 |
4 | 3301112132103300 |
5 | 31243043402433 |
6 | 1505444230000 |
7 | 202225430613 |
oct | 36126362360 |
9 | 11405250600 |
10 | 4049200368 |
11 | 1798739194 |
12 | 95009b300 |
13 | 4c6b89b65 |
14 | 2a5ac017a |
15 | 18a743113 |
hex | f159e4f0 |
4049200368 has 60 divisors (see below), whose sum is σ = 11751857208. Its totient is φ = 1349732160.
The previous prime is 4049200367. The next prime is 4049200373. The reversal of 4049200368 is 8630029404.
It is a happy number.
It is a super-2 number, since 2×40492003682 = 32792047240422670848, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4049200367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 516843 + ... + 524618.
Almost surely, 24049200368 is an apocalyptic number.
4049200368 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4049200368 is an abundant number, since it is smaller than the sum of its proper divisors (7702656840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4049200368 is a wasteful number, since it uses less digits than its factorization.
4049200368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041484 (or 1041466 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
The square root of 4049200368 is about 63633.3274943249. The cubic root of 4049200368 is about 1593.8829412150.
The spelling of 4049200368 in words is "four billion, forty-nine million, two hundred thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •