Base | Representation |
---|---|
bin | 1000010110010001… |
… | …11110011010011110 |
3 | 102120100102120002120 |
4 | 10023020332122132 |
5 | 33134324310340 |
6 | 2020422003410 |
7 | 216031155561 |
oct | 41310763236 |
9 | 12510376076 |
10 | 4481869470 |
11 | 199a997961 |
12 | a50b76566 |
13 | 5656c9290 |
14 | 30734a4d8 |
15 | 1b370b4d0 |
hex | 10b23e69e |
4481869470 has 128 divisors (see below), whose sum is σ = 12287213568. Its totient is φ = 1037836800.
The previous prime is 4481869463. The next prime is 4481869487. The reversal of 4481869470 is 749681844.
It is a super-2 number, since 2×44818694702 = 40174307892236161800, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 543075 + ... + 551265.
It is an arithmetic number, because the mean of its divisors is an integer number (95993856).
Almost surely, 24481869470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4481869470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6143606784).
4481869470 is an abundant number, since it is smaller than the sum of its proper divisors (7805344098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4481869470 is a wasteful number, since it uses less digits than its factorization.
4481869470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8298.
The product of its (nonzero) digits is 1548288, while the sum is 51.
The square root of 4481869470 is about 66946.7659413059. The cubic root of 4481869470 is about 1648.7433921789.
The spelling of 4481869470 in words is "four billion, four hundred eighty-one million, eight hundred sixty-nine thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •