Base | Representation |
---|---|
bin | 100101101110110… |
… | …0010011100000000 |
3 | 10021020021012202011 |
4 | 1023131202130000 |
5 | 10043101100212 |
6 | 325343302304 |
7 | 43242054325 |
oct | 11335423400 |
9 | 3236235664 |
10 | 1266034432 |
11 | 59a709453 |
12 | 2b3baa994 |
13 | 1723a5000 |
14 | c01dcb4c |
15 | 762314a7 |
hex | 4b762700 |
1266034432 has 72 divisors (see below), whose sum is σ = 2738837360. Its totient is φ = 584064000.
The previous prime is 1266034403. The next prime is 1266034433. The reversal of 1266034432 is 2344306621.
It is a junction number, because it is equal to n+sod(n) for n = 1266034394 and 1266034403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1266034433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 561307 + ... + 563557.
Almost surely, 21266034432 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 1266034432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1369418680).
1266034432 is an abundant number, since it is smaller than the sum of its proper divisors (1472802928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1266034432 is an frugal number, since it uses more digits than its factorization.
1266034432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2306 (or 2266 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
The square root of 1266034432 is about 35581.3776012116. The cubic root of 1266034432 is about 1081.8038077476.
The spelling of 1266034432 in words is "one billion, two hundred sixty-six million, thirty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •