Base | Representation |
---|---|
bin | 11101010010001000010… |
… | …11010010001100010111 |
3 | 10120012002110010121102020 |
4 | 32221010023102030113 |
5 | 112441112013443210 |
6 | 2050120520344223 |
7 | 132456510133254 |
oct | 16510413221427 |
9 | 3505073117366 |
10 | 1006166156055 |
11 | 358792623235 |
12 | 143003015073 |
13 | 73b5b8cc0a8 |
14 | 369ad34842b |
15 | 1b28cc70770 |
hex | ea442d2317 |
1006166156055 has 8 divisors (see below), whose sum is σ = 1609865849712. Its totient is φ = 536621949888.
The previous prime is 1006166156011. The next prime is 1006166156057. The reversal of 1006166156055 is 5506516616001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1006166156055 - 210 = 1006166155031 is a prime.
It is a super-2 number, since 2×10061661560552 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1006166155998 and 1006166156016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1006166156057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33538871854 + ... + 33538871883.
It is an arithmetic number, because the mean of its divisors is an integer number (201233231214).
Almost surely, 21006166156055 is an apocalyptic number.
1006166156055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1006166156055 is a deficient number, since it is larger than the sum of its proper divisors (603699693657).
1006166156055 is an equidigital number, since it uses as much as digits as its factorization.
1006166156055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67077743745.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 1006166156055 in words is "one trillion, six billion, one hundred sixty-six million, one hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •