Base | Representation |
---|---|
bin | 111111011011011… |
… | …111100111001100 |
3 | 2202011102112112001 |
4 | 333123133213030 |
5 | 4134412000410 |
6 | 253332522044 |
7 | 35241212134 |
oct | 7733374714 |
9 | 2664375461 |
10 | 1064171980 |
11 | 4a6774183 |
12 | 258480324 |
13 | 13c618081 |
14 | a1493ac4 |
15 | 6365a33a |
hex | 3f6df9cc |
1064171980 has 12 divisors (see below), whose sum is σ = 2234761200. Its totient is φ = 425668784.
The previous prime is 1064171923. The next prime is 1064171987. The reversal of 1064171980 is 891714601.
It is a super-2 number, since 2×10641719802 = 2264924006034240800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1064171987) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26604280 + ... + 26604319.
It is an arithmetic number, because the mean of its divisors is an integer number (186230100).
Almost surely, 21064171980 is an apocalyptic number.
1064171980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1064171980 is an abundant number, since it is smaller than the sum of its proper divisors (1170589220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064171980 is a wasteful number, since it uses less digits than its factorization.
1064171980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53208608 (or 53208606 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 37.
The square root of 1064171980 is about 32621.6489466734. The cubic root of 1064171980 is about 1020.9487456056.
It can be divided in two parts, 10641 and 71980, that added together give a triangular number (82621 = T406).
The spelling of 1064171980 in words is "one billion, sixty-four million, one hundred seventy-one thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •