Base | Representation |
---|---|
bin | 1111111000000010… |
… | …0010110000000000 |
3 | 101222222212102201210 |
4 | 3332000202300000 |
5 | 32211424231300 |
6 | 1542511530120 |
7 | 210414423120 |
oct | 37600426000 |
9 | 11888772653 |
10 | 4261555200 |
11 | 189759a551 |
12 | 9ab229940 |
13 | 52bb7b7c6 |
14 | 2c5d9ac80 |
15 | 19e1dd050 |
hex | fe022c00 |
4261555200 has 264 divisors, whose sum is σ = 16098787072. Its totient is φ = 973946880.
The previous prime is 4261555141. The next prime is 4261555229. The reversal of 4261555200 is 25551624.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 533637 + ... + 541563.
Almost surely, 24261555200 is an apocalyptic number.
4261555200 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 4261555200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8049393536).
4261555200 is an abundant number, since it is smaller than the sum of its proper divisors (11837231872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4261555200 is a wasteful number, since it uses less digits than its factorization.
4261555200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7967 (or 7944 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
The square root of 4261555200 is about 65280.5882326439. The cubic root of 4261555200 is about 1621.2725864051.
The spelling of 4261555200 in words is "four billion, two hundred sixty-one million, five hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •