Base | Representation |
---|---|
bin | 100101101111100… |
… | …0101100110011100 |
3 | 10021021000211220120 |
4 | 1023133011212130 |
5 | 10043202044404 |
6 | 325400114540 |
7 | 43245365442 |
oct | 11337054634 |
9 | 3237024816 |
10 | 1266440604 |
11 | 59a966630 |
12 | 2b4165a50 |
13 | 1724b7b50 |
14 | c02a6b92 |
15 | 762b19d9 |
hex | 4b7c599c |
1266440604 has 96 divisors (see below), whose sum is σ = 3497630976. Its totient is φ = 351598080.
The previous prime is 1266440599. The next prime is 1266440621. The reversal of 1266440604 is 4060446621.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 232399 + ... + 237785.
It is an arithmetic number, because the mean of its divisors is an integer number (36433656).
Almost surely, 21266440604 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1266440604, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1748815488).
1266440604 is an abundant number, since it is smaller than the sum of its proper divisors (2231190372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1266440604 is a wasteful number, since it uses less digits than its factorization.
1266440604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5555 (or 5553 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 33.
The square root of 1266440604 is about 35587.0847920984. The cubic root of 1266440604 is about 1081.9194842842.
The spelling of 1266440604 in words is "one billion, two hundred sixty-six million, four hundred forty thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •