Base | Representation |
---|---|
bin | 10110111101110000001001… |
… | …001111100010010101111111 |
3 | 111020121120012220000222012010 |
4 | 112331300021033202111333 |
5 | 101214243220114004021 |
6 | 554451012101542303 |
7 | 30163024112621520 |
oct | 2675601117422577 |
9 | 436546186028163 |
10 | 101000606000511 |
11 | 2a200131009238 |
12 | b3b2716714993 |
13 | 4448415b2b669 |
14 | 1ad2653924847 |
15 | ba23ce33b976 |
hex | 5bdc093e257f |
101000606000511 has 32 divisors (see below), whose sum is σ = 159405297200640. Its totient is φ = 55657090532736.
The previous prime is 101000606000501. The next prime is 101000606000521. The reversal of 101000606000511 is 115000606000101.
It is an interprime number because it is at equal distance from previous prime (101000606000501) and next prime (101000606000521).
It is not a de Polignac number, because 101000606000511 - 26 = 101000606000447 is a prime.
It is a super-2 number, since 2×1010006060005112 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000606000501) 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, 99766396 + ... + 100773681.
It is an arithmetic number, because the mean of its divisors is an integer number (4981415537520).
Almost surely, 2101000606000511 is an apocalyptic number.
101000606000511 is a deficient number, since it is larger than the sum of its proper divisors (58404691200129).
101000606000511 is a wasteful number, since it uses less digits than its factorization.
101000606000511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200540943.
The product of its (nonzero) digits is 180, while the sum is 21.
The spelling of 101000606000511 in words is "one hundred one trillion, six hundred six million, five hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •