Base | Representation |
---|---|
bin | 1111000100011010… |
… | …1101011111111000 |
3 | 101102220111202111201 |
4 | 3301012231133320 |
5 | 31241014141110 |
6 | 1505215503544 |
7 | 202145340661 |
oct | 36106553770 |
9 | 11386452451 |
10 | 4045068280 |
11 | 1796376740 |
12 | 94a827bb4 |
13 | 4c6071136 |
14 | 2a5326368 |
15 | 18a1c8b3a |
hex | f11ad7f8 |
4045068280 has 64 divisors (see below), whose sum is σ = 9939840480. Its totient is φ = 1469299200.
The previous prime is 4045068229. The next prime is 4045068283. The reversal of 4045068280 is 828605404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4045068283) 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 15 ways as a sum of consecutive naturals, for example, 434070 + ... + 443290.
Almost surely, 24045068280 is an apocalyptic number.
4045068280 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 4045068280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4969920240).
4045068280 is an abundant number, since it is smaller than the sum of its proper divisors (5894772200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4045068280 is a wasteful number, since it uses less digits than its factorization.
4045068280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10240 (or 10236 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 37.
The square root of 4045068280 is about 63600.8512521649. The cubic root of 4045068280 is about 1593.3405867136.
The spelling of 4045068280 in words is "four billion, forty-five million, sixty-eight thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •