Base | Representation |
---|---|
bin | 110001011000001001… |
… | …0001100110011011001 |
3 | 101010200212220100022200 |
4 | 1202300102030303121 |
5 | 3214130403314103 |
6 | 120413532040413 |
7 | 10442455503660 |
oct | 1426022146331 |
9 | 333625810280 |
10 | 106036776153 |
11 | 40a73aa5400 |
12 | 18673603109 |
13 | 9ccb3b3839 |
14 | 51bcac3dd7 |
15 | 2b591d90a3 |
hex | 18b048ccd9 |
106036776153 has 144 divisors (see below), whose sum is σ = 203911344000. Its totient is φ = 51882969600.
The previous prime is 106036776151. The next prime is 106036776173. The reversal of 106036776153 is 351677630601.
106036776153 is a `hidden beast` number, since 10 + 60 + 367 + 76 + 153 = 666.
It is not a de Polignac number, because 106036776153 - 21 = 106036776151 is a prime.
It is a super-2 number, since 2×1060367761532 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 106036776099 and 106036776108.
It is not an unprimeable number, because it can be changed into a prime (106036776151) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 9057898 + ... + 9069596.
It is an arithmetic number, because the mean of its divisors is an integer number (1416051000).
Almost surely, 2106036776153 is an apocalyptic number.
It is an amenable number.
106036776153 is a deficient number, since it is larger than the sum of its proper divisors (97874567847).
106036776153 is a wasteful number, since it uses less digits than its factorization.
106036776153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11804 (or 11790 counting only the distinct ones).
The product of its (nonzero) digits is 476280, while the sum is 45.
The spelling of 106036776153 in words is "one hundred six billion, thirty-six million, seven hundred seventy-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •