Base | Representation |
---|---|
bin | 1111001101000111… |
… | …1010101100000000 |
3 | 101112110011202011202 |
4 | 3303101322230000 |
5 | 31324334412240 |
6 | 1513002000332 |
7 | 203100455525 |
oct | 36321725400 |
9 | 11473152152 |
10 | 4081560320 |
11 | 1804a30752 |
12 | 95aaa60a8 |
13 | 5007aa066 |
14 | 2aa10514c |
15 | 18d4d6315 |
hex | f347ab00 |
4081560320 has 72 divisors (see below), whose sum is σ = 9810881136. Its totient is φ = 1626902528.
The previous prime is 4081560313. The next prime is 4081560331. The reversal of 4081560320 is 230651804.
It is a super-3 number, since 3×40815603203 (a number of 30 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 369599 + ... + 380481.
It is an arithmetic number, because the mean of its divisors is an integer number (136262238).
Almost surely, 24081560320 is an apocalyptic number.
4081560320 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 4081560320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4905440568).
4081560320 is an abundant number, since it is smaller than the sum of its proper divisors (5729320816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4081560320 is a wasteful number, since it uses less digits than its factorization.
4081560320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11197 (or 11183 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 4081560320 is about 63887.0904017392. The cubic root of 4081560320 is about 1598.1176196043.
The spelling of 4081560320 in words is "four billion, eighty-one million, five hundred sixty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •