Base | Representation |
---|---|
bin | 111111011101011… |
… | …000010000010100 |
3 | 2202012100122100222 |
4 | 333131120100110 |
5 | 4140023304012 |
6 | 253351253512 |
7 | 35245340615 |
oct | 7735302024 |
9 | 2665318328 |
10 | 1064666132 |
11 | 4a6a81472 |
12 | 25867a298 |
13 | 13c75bc7a |
14 | a1581c0c |
15 | 63706972 |
hex | 3f758414 |
1064666132 has 6 divisors (see below), whose sum is σ = 1863165738. Its totient is φ = 532333064.
The previous prime is 1064666129. The next prime is 1064666143. The reversal of 1064666132 is 2316664601.
1064666132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 734735236 + 329930896 = 27106^2 + 18164^2 .
It is a super-2 number, since 2×10646661322 = 2267027945255682848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1064666092 and 1064666101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133083263 + ... + 133083270.
It is an arithmetic number, because the mean of its divisors is an integer number (310527623).
Almost surely, 21064666132 is an apocalyptic number.
It is an amenable number.
1064666132 is a deficient number, since it is larger than the sum of its proper divisors (798499606).
1064666132 is a wasteful number, since it uses less digits than its factorization.
1064666132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266166537 (or 266166535 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 1064666132 is about 32629.2220563102. Note that the first 3 decimals coincide. The cubic root of 1064666132 is about 1021.1067481982.
The spelling of 1064666132 in words is "one billion, sixty-four million, six hundred sixty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •