Base | Representation |
---|---|
bin | 111111100011101… |
… | …010011011101010 |
3 | 2202022110100001202 |
4 | 333203222123222 |
5 | 4140434012300 |
6 | 253450444202 |
7 | 35265341366 |
oct | 7743523352 |
9 | 2668410052 |
10 | 1066313450 |
11 | 4a79a7094 |
12 | 259133662 |
13 | 13cbb7a07 |
14 | a18902a6 |
15 | 6392ead5 |
hex | 3f8ea6ea |
1066313450 has 48 divisors (see below), whose sum is σ = 2030495040. Its totient is φ = 416507520.
The previous prime is 1066313447. The next prime is 1066313453. The reversal of 1066313450 is 543136601.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1066313447) and next prime (1066313453).
It is a super-2 number, since 2×10663134502 = 2274048747301805000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1066313453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 367907 + ... + 370793.
It is an arithmetic number, because the mean of its divisors is an integer number (42301980).
Almost surely, 21066313450 is an apocalyptic number.
1066313450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1066313450 is a deficient number, since it is larger than the sum of its proper divisors (964181590).
1066313450 is a wasteful number, since it uses less digits than its factorization.
1066313450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3071 (or 3066 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 1066313450 is about 32654.4552856115. The cubic root of 1066313450 is about 1021.6331168806.
The spelling of 1066313450 in words is "one billion, sixty-six million, three hundred thirteen thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •