Base | Representation |
---|---|
bin | 110001011000111000… |
… | …0100100100110010011 |
3 | 101010202121110012212000 |
4 | 1202301300210212103 |
5 | 3214203221441110 |
6 | 120420214205043 |
7 | 10443206001231 |
oct | 1426160444623 |
9 | 333677405760 |
10 | 106061515155 |
11 | 40a86a62162 |
12 | 1867b953783 |
13 | a003565cbb |
14 | 51c20c3951 |
15 | 2b5b4741c0 |
hex | 18b1c24993 |
106061515155 has 32 divisors (see below), whose sum is σ = 188595025920. Its totient is φ = 56553775200.
The previous prime is 106061515151. The next prime is 106061515177. The reversal of 106061515155 is 551515160601.
It is a happy number.
106061515155 is a `hidden beast` number, since 10 + 6 + 0 + 615 + 15 + 15 + 5 = 666.
It is not a de Polignac number, because 106061515155 - 22 = 106061515151 is a prime.
It is a super-2 number, since 2×1060615151552 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106061515151) 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, 551380 + ... + 718430.
It is an arithmetic number, because the mean of its divisors is an integer number (5893594560).
Almost surely, 2106061515155 is an apocalyptic number.
106061515155 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106061515155 is a deficient number, since it is larger than the sum of its proper divisors (82533510765).
106061515155 is a wasteful number, since it uses less digits than its factorization.
106061515155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171768 (or 171762 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
Adding to 106061515155 its reverse (551515160601), we get a palindrome (657576675756).
The spelling of 106061515155 in words is "one hundred six billion, sixty-one million, five hundred fifteen thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •