Base | Representation |
---|---|
bin | 10001000000001110110… |
… | …001100001000100001100 |
3 | 11010201001022022200020210 |
4 | 101000032301201010030 |
5 | 123121021103403103 |
6 | 2252443011242420 |
7 | 150263666222553 |
oct | 21001661410414 |
9 | 4121038280223 |
10 | 1168478966028 |
11 | 410604a067a0 |
12 | 16a5612a9410 |
13 | 8625807770a |
14 | 407aa0a2d9a |
15 | 205dc7aee03 |
hex | 1100ec6110c |
1168478966028 has 24 divisors (see below), whose sum is σ = 2974310095680. Its totient is φ = 354084535120.
The previous prime is 1168478966027. The next prime is 1168478966071. The reversal of 1168478966028 is 8206698748611.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a self number, because there is not a number n which added to its sum of digits gives 1168478966028.
It is not an unprimeable number, because it can be changed into a prime (1168478966027) 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, 4426056558 + ... + 4426056821.
It is an arithmetic number, because the mean of its divisors is an integer number (123929587320).
Almost surely, 21168478966028 is an apocalyptic number.
It is an amenable number.
1168478966028 is an abundant number, since it is smaller than the sum of its proper divisors (1805831129652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1168478966028 is a wasteful number, since it uses less digits than its factorization.
1168478966028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8852113397 (or 8852113395 counting only the distinct ones).
The product of its (nonzero) digits is 55738368, while the sum is 66.
The spelling of 1168478966028 in words is "one trillion, one hundred sixty-eight billion, four hundred seventy-eight million, nine hundred sixty-six thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •