Base | Representation |
---|---|
bin | 110001011000010110… |
… | …1110110110010011101 |
3 | 101010201101112200021000 |
4 | 1202300231312302131 |
5 | 3214134232313023 |
6 | 120414351300513 |
7 | 10442604230412 |
oct | 1426055666235 |
9 | 333641480230 |
10 | 106044026013 |
11 | 40a780a7322 |
12 | 18675b1a739 |
13 | 9ccca516b3 |
14 | 51bda50109 |
15 | 2b59b6c243 |
hex | 18b0b76c9d |
106044026013 has 32 divisors (see below), whose sum is σ = 165591603200. Its totient is φ = 66885750000.
The previous prime is 106044026003. The next prime is 106044026017. The reversal of 106044026013 is 310620440601.
106044026013 is a `hidden beast` number, since 1 + 0 + 604 + 40 + 2 + 6 + 0 + 13 = 666.
It is not a de Polignac number, because 106044026013 - 28 = 106044025757 is a prime.
It is a super-2 number, since 2×1060440260132 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106044026017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 247638 + ... + 522888.
It is an arithmetic number, because the mean of its divisors is an integer number (5174737600).
Almost surely, 2106044026013 is an apocalyptic number.
It is an amenable number.
106044026013 is a deficient number, since it is larger than the sum of its proper divisors (59547577187).
106044026013 is a wasteful number, since it uses less digits than its factorization.
106044026013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276030 (or 276024 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 106044026013 its reverse (310620440601), we get a palindrome (416664466614).
The spelling of 106044026013 in words is "one hundred six billion, forty-four million, twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •