Base | Representation |
---|---|
bin | 11000000111010011111110… |
… | …011011100011111111100111 |
3 | 111220111211001012011011122220 |
4 | 120013103332123203333213 |
5 | 102400103332341023030 |
6 | 1013321134234323423 |
7 | 31224156443251053 |
oct | 3007237633437747 |
9 | 456454035134586 |
10 | 106055601111015 |
11 | 30879a22a66246 |
12 | ba8a352289573 |
13 | 472400079b81a |
14 | 1c29193188c63 |
15 | c3db39be0a10 |
hex | 6074fe6e3fe7 |
106055601111015 has 32 divisors (see below), whose sum is σ = 183447526264320. Its totient is φ = 52137717980544.
The previous prime is 106055601111011. The next prime is 106055601111017. The reversal of 106055601111015 is 510111106550601.
It is not a de Polignac number, because 106055601111015 - 22 = 106055601111011 is a prime.
It is a super-2 number, since 2×1060556011110152 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106055601111011) 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, 5028704539 + ... + 5028725628.
It is an arithmetic number, because the mean of its divisors is an integer number (5732735195760).
Almost surely, 2106055601111015 is an apocalyptic number.
106055601111015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106055601111015 is a deficient number, since it is larger than the sum of its proper divisors (77391925153305).
106055601111015 is a wasteful number, since it uses less digits than its factorization.
106055601111015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10057430231.
The product of its (nonzero) digits is 4500, while the sum is 33.
Adding to 106055601111015 its reverse (510111106550601), we get a palindrome (616166707661616).
The spelling of 106055601111015 in words is "one hundred six trillion, fifty-five billion, six hundred one million, one hundred eleven thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •