Base | Representation |
---|---|
bin | 10110110100100111000… |
… | …111101100000110011001 |
3 | 12112221002212121202020020 |
4 | 112310213013230012121 |
5 | 201143404230440410 |
6 | 3200250451221053 |
7 | 221210262601626 |
oct | 26644707540631 |
9 | 5487085552206 |
10 | 1568319390105 |
11 | 555136456366 |
12 | 213b4aba7789 |
13 | b4b79613320 |
14 | 55c9ada734d |
15 | 2abe0186a70 |
hex | 16d271ec199 |
1568319390105 has 32 divisors (see below), whose sum is σ = 2844563111040. Its totient is φ = 731459082240.
The previous prime is 1568319390083. The next prime is 1568319390119. The reversal of 1568319390105 is 5010939138651.
It is not a de Polignac number, because 1568319390105 - 210 = 1568319389081 is a prime.
It is a super-2 number, since 2×15683193901052 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 211645336 + ... + 211652745.
It is an arithmetic number, because the mean of its divisors is an integer number (88892597220).
Almost surely, 21568319390105 is an apocalyptic number.
1568319390105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1568319390105 is a deficient number, since it is larger than the sum of its proper divisors (1276243720935).
1568319390105 is a wasteful number, since it uses less digits than its factorization.
1568319390105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423298121.
The product of its (nonzero) digits is 874800, while the sum is 51.
The spelling of 1568319390105 in words is "one trillion, five hundred sixty-eight billion, three hundred nineteen million, three hundred ninety thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •