Base | Representation |
---|---|
bin | 10110111101110101001011… |
… | …000011100000011101001110 |
3 | 111020122002011011102011212200 |
4 | 112331311023003200131032 |
5 | 101214340244302014411 |
6 | 554453303531342330 |
7 | 30163304652403341 |
oct | 2675651303403516 |
9 | 436562134364780 |
10 | 101006005110606 |
11 | 2a2024517335a2 |
12 | b3b37828b19a6 |
13 | 4448a9657976b |
14 | 1ad2a069d8458 |
15 | ba25e832ce56 |
hex | 5bdd4b0e074e |
101006005110606 has 12 divisors (see below), whose sum is σ = 218846344406352. Its totient is φ = 33668668370196.
The previous prime is 101006005110541. The next prime is 101006005110683. The reversal of 101006005110606 is 606011500600101.
101006005110606 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 0 + 6 + 0 + 0 + 51 + 1 + 0 + 606 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 101006005110606.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2805722364166 + ... + 2805722364201.
It is an arithmetic number, because the mean of its divisors is an integer number (18237195367196).
Almost surely, 2101006005110606 is an apocalyptic number.
101006005110606 is an abundant number, since it is smaller than the sum of its proper divisors (117840339295746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101006005110606 is a wasteful number, since it uses less digits than its factorization.
101006005110606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5611444728375 (or 5611444728372 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 101006005110606 its reverse (606011500600101), we get a palindrome (707017505710707).
The spelling of 101006005110606 in words is "one hundred one trillion, six billion, five million, one hundred ten thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •