Base | Representation |
---|---|
bin | 11111000110000011100… |
… | …10111000000011001101 |
3 | 10210010201212011111011102 |
4 | 33203001302320003031 |
5 | 120001042211311002 |
6 | 2134452341032445 |
7 | 140122012414205 |
oct | 17430162700315 |
9 | 3703655144142 |
10 | 1068403228877 |
11 | 38211a851206 |
12 | 1530920b5725 |
13 | 7999996acba |
14 | 399d4d69405 |
15 | 1cbd1ab4a02 |
hex | f8c1cb80cd |
1068403228877 has 8 divisors (see below), whose sum is σ = 1133751401280. Its totient is φ = 1004629711360.
The previous prime is 1068403228861. The next prime is 1068403228931. The reversal of 1068403228877 is 7788223048601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1068403228877 - 24 = 1068403228861 is a prime.
It is a super-2 number, since 2×10684032288772 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068403228577) 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 7 ways as a sum of consecutive naturals, for example, 393662324 + ... + 393665037.
It is an arithmetic number, because the mean of its divisors is an integer number (141718925160).
Almost surely, 21068403228877 is an apocalyptic number.
It is an amenable number.
1068403228877 is a deficient number, since it is larger than the sum of its proper divisors (65348172403).
1068403228877 is an equidigital number, since it uses as much as digits as its factorization.
1068403228877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787327443.
The product of its (nonzero) digits is 7225344, while the sum is 56.
The spelling of 1068403228877 in words is "one trillion, sixty-eight billion, four hundred three million, two hundred twenty-eight thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •