Base | Representation |
---|---|
bin | 10110100110011111111… |
… | …010101101110010000001 |
3 | 12111110222211011001120102 |
4 | 112212133322231302001 |
5 | 200421341014204243 |
6 | 3145303101052145 |
7 | 220132622362310 |
oct | 26463772556201 |
9 | 5443884131512 |
10 | 1553166163073 |
11 | 54976a898638 |
12 | 211020257055 |
13 | b36031085b5 |
14 | 55260698277 |
15 | 2a604ba69b8 |
hex | 1699feadc81 |
1553166163073 has 8 divisors (see below), whose sum is σ = 1775057305920. Its totient is φ = 1331277585840.
The previous prime is 1553166163027. The next prime is 1553166163117. The reversal of 1553166163073 is 3703616613551.
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 1553166163073 - 26 = 1553166163009 is a prime.
It is a super-2 number, since 2×15531661630732 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1553166163273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 904118 + ... + 1980848.
It is an arithmetic number, because the mean of its divisors is an integer number (221882163240).
Almost surely, 21553166163073 is an apocalyptic number.
It is an amenable number.
1553166163073 is a deficient number, since it is larger than the sum of its proper divisors (221891142847).
1553166163073 is a wasteful number, since it uses less digits than its factorization.
1553166163073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282807.
The product of its (nonzero) digits is 1020600, while the sum is 47.
The spelling of 1553166163073 in words is "one trillion, five hundred fifty-three billion, one hundred sixty-six million, one hundred sixty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •