Base | Representation |
---|---|
bin | 10110111110101000011100… |
… | …000100111010110000001011 |
3 | 111020211100020102221211020010 |
4 | 112332220130010322300023 |
5 | 101221241013142314110 |
6 | 554534450043203003 |
7 | 30200264032252020 |
oct | 2676503404726013 |
9 | 436740212854203 |
10 | 101061051526155 |
11 | 2a223829a26306 |
12 | b402385816463 |
13 | 4451029979a96 |
14 | 1ad554962d547 |
15 | ba3c6ac47020 |
hex | 5bea1c13ac0b |
101061051526155 has 64 divisors (see below), whose sum is σ = 184924488637440. Its totient is φ = 46167564681216.
The previous prime is 101061051526153. The next prime is 101061051526261. The reversal of 101061051526155 is 551625150160101.
It is not a de Polignac number, because 101061051526155 - 21 = 101061051526153 is a prime.
It is a super-2 number, since 2×1010610515261552 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101061051526153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 915991824 + ... + 916102146.
It is an arithmetic number, because the mean of its divisors is an integer number (2889445134960).
Almost surely, 2101061051526155 is an apocalyptic number.
101061051526155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101061051526155 is a deficient number, since it is larger than the sum of its proper divisors (83863437111285).
101061051526155 is a wasteful number, since it uses less digits than its factorization.
101061051526155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116260.
The product of its (nonzero) digits is 45000, while the sum is 39.
The spelling of 101061051526155 in words is "one hundred one trillion, sixty-one billion, fifty-one million, five hundred twenty-six thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •