Base | Representation |
---|---|
bin | 110001010111111101… |
… | …0010011100101011101 |
3 | 101010200110010010011200 |
4 | 1202233322103211131 |
5 | 3214122302344402 |
6 | 120413145510113 |
7 | 10442351325351 |
oct | 1425772234535 |
9 | 333613103150 |
10 | 106030512477 |
11 | 40a7050740a |
12 | 186714a2339 |
13 | 9cc9ccc816 |
14 | 51bbd33461 |
15 | 2b5889d21c |
hex | 18afe9395d |
106030512477 has 12 divisors (see below), whose sum is σ = 153235775004. Its totient is φ = 70649812800.
The previous prime is 106030512457. The next prime is 106030512479. The reversal of 106030512477 is 774215030601.
It is a happy number.
106030512477 is a `hidden beast` number, since 1 + 0 + 603 + 0 + 5 + 1 + 2 + 47 + 7 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 28752628356 + 77277884121 = 169566^2 + 277989^2 .
It is not a de Polignac number, because 106030512477 - 223 = 106022123869 is a prime.
It is a super-2 number, since 2×1060305124772 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106030512479) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3081568 + ... + 3115785.
It is an arithmetic number, because the mean of its divisors is an integer number (12769647917).
Almost surely, 2106030512477 is an apocalyptic number.
It is an amenable number.
106030512477 is a deficient number, since it is larger than the sum of its proper divisors (47205262527).
106030512477 is a wasteful number, since it uses less digits than its factorization.
106030512477 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6199260 (or 6199257 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 36.
The spelling of 106030512477 in words is "one hundred six billion, thirty million, five hundred twelve thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •