Base | Representation |
---|---|
bin | 11000001100100001011010… |
… | …000101010010100110110001 |
3 | 111221210001011012212002121221 |
4 | 120030201122011102212301 |
5 | 102421440043442441230 |
6 | 1014153424224345041 |
7 | 31262062505522602 |
oct | 3014413205224661 |
9 | 457701135762557 |
10 | 106413621062065 |
11 | 309a784398a509 |
12 | bb2780a475181 |
13 | 474b9b8a772c5 |
14 | 1c3c637bd9da9 |
15 | c480e0d8127a |
hex | 60c85a1529b1 |
106413621062065 has 16 divisors (see below), whose sum is σ = 131818420371456. Its totient is φ = 82382965041600.
The previous prime is 106413621062027. The next prime is 106413621062087. The reversal of 106413621062065 is 560260126314601.
It is not a de Polignac number, because 106413621062065 - 227 = 106413486844337 is a prime.
It is a super-2 number, since 2×1064136210620652 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 146122 + ... + 14589331.
It is an arithmetic number, because the mean of its divisors is an integer number (8238651273216).
Almost surely, 2106413621062065 is an apocalyptic number.
It is an amenable number.
106413621062065 is a deficient number, since it is larger than the sum of its proper divisors (25404799309391).
106413621062065 is a wasteful number, since it uses less digits than its factorization.
106413621062065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14782080.
The product of its (nonzero) digits is 311040, while the sum is 43.
Adding to 106413621062065 its reverse (560260126314601), we get a palindrome (666673747376666).
The spelling of 106413621062065 in words is "one hundred six trillion, four hundred thirteen billion, six hundred twenty-one million, sixty-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •