Base | Representation |
---|---|
bin | 11000000110111000100001… |
… | …100001010111110101011101 |
3 | 111220101222221221202220210212 |
4 | 120012320201201113311131 |
5 | 102344113001004044230 |
6 | 1013255421320342205 |
7 | 31222064135065355 |
oct | 3006704141276535 |
9 | 456358857686725 |
10 | 106026125065565 |
11 | 30868477560001 |
12 | ba846a6914965 |
13 | 47212b3b27c03 |
14 | 1c2799856db65 |
15 | c3ceb20b2895 |
hex | 606e21857d5d |
106026125065565 has 16 divisors (see below), whose sum is σ = 129946934527488. Its totient is φ = 83010747488256.
The previous prime is 106026125065561. The next prime is 106026125065573. The reversal of 106026125065565 is 565560521620601.
It is a cyclic number.
It is not a de Polignac number, because 106026125065565 - 22 = 106026125065561 is a prime.
It is a super-2 number, since 2×1060261250655652 (a number of 29 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 (106026125065561) 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 15 ways as a sum of consecutive naturals, for example, 11229377 + ... + 18388886.
It is an arithmetic number, because the mean of its divisors is an integer number (8121683407968).
Almost surely, 2106026125065565 is an apocalyptic number.
It is an amenable number.
106026125065565 is a deficient number, since it is larger than the sum of its proper divisors (23920809461923).
106026125065565 is a wasteful number, since it uses less digits than its factorization.
106026125065565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29633548.
The product of its (nonzero) digits is 3240000, while the sum is 50.
The spelling of 106026125065565 in words is "one hundred six trillion, twenty-six billion, one hundred twenty-five million, sixty-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •