Base | Representation |
---|---|
bin | 10110110101001010000… |
… | …010010111101001010001 |
3 | 12112222121200220212210220 |
4 | 112311022002113221101 |
5 | 201201104212320121 |
6 | 3200424535143253 |
7 | 221230635102060 |
oct | 26651202275121 |
9 | 5488550825726 |
10 | 1568905198161 |
11 | 5554070a0654 |
12 | 214093214b29 |
13 | b4c40ab0302 |
14 | 55d14ad81d7 |
15 | 2ac267ee6c6 |
hex | 16d4a097a51 |
1568905198161 has 32 divisors (see below), whose sum is σ = 2470995652608. Its totient is φ = 866870780160.
The previous prime is 1568905198103. The next prime is 1568905198169. The reversal of 1568905198161 is 1618915098651.
It is not a de Polignac number, because 1568905198161 - 26 = 1568905198097 is a prime.
It is a super-2 number, since 2×15689051981612 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1568905198095 and 1568905198104.
It is not an unprimeable number, because it can be changed into a prime (1568905198169) 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 31 ways as a sum of consecutive naturals, for example, 9493800 + ... + 9657641.
It is an arithmetic number, because the mean of its divisors is an integer number (77218614144).
Almost surely, 21568905198161 is an apocalyptic number.
It is an amenable number.
1568905198161 is a deficient number, since it is larger than the sum of its proper divisors (902090454447).
1568905198161 is a wasteful number, since it uses less digits than its factorization.
1568905198161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19151581.
The product of its (nonzero) digits is 4665600, while the sum is 60.
The spelling of 1568905198161 in words is "one trillion, five hundred sixty-eight billion, nine hundred five million, one hundred ninety-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •