Base | Representation |
---|---|
bin | 100001001101000… |
… | …1110001011010010 |
3 | 2212122111201000000 |
4 | 1002122032023102 |
5 | 4240211420231 |
6 | 302320310430 |
7 | 36416201142 |
oct | 10232161322 |
9 | 2778451000 |
10 | 1114170066 |
11 | 521a13509 |
12 | 271172416 |
13 | 149aa2639 |
14 | a7d8a922 |
15 | 67c346e6 |
hex | 4268e2d2 |
1114170066 has 56 divisors (see below), whose sum is σ = 2511504144. Its totient is φ = 370536120.
The previous prime is 1114169989. The next prime is 1114170067. The reversal of 1114170066 is 6600714111.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1114170067) 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 27 ways as a sum of consecutive naturals, for example, 1146961 + ... + 1147931.
Almost surely, 21114170066 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1114170066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1255752072).
1114170066 is an abundant number, since it is smaller than the sum of its proper divisors (1397334078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114170066 is an frugal number, since it uses more digits than its factorization.
1114170066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1778 (or 1763 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 1114170066 is about 33379.1861194967. The cubic root of 1114170066 is about 1036.6937861391.
Adding to 1114170066 its reverse (6600714111), we get a palindrome (7714884177).
The spelling of 1114170066 in words is "one billion, one hundred fourteen million, one hundred seventy thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •