Base | Representation |
---|---|
bin | 11000000110100000010010… |
… | …111101110011000011001011 |
3 | 111220022111210222211021001222 |
4 | 120012200102331303003023 |
5 | 102343201211412230201 |
6 | 1013235440114032255 |
7 | 31220153365461203 |
oct | 3006402275630313 |
9 | 456274728737058 |
10 | 106000111055051 |
11 | 30858438300964 |
12 | ba7b64687868b |
13 | 471b9c94ba395 |
14 | 1c2660b66d403 |
15 | c3c48d39291b |
hex | 606812f730cb |
106000111055051 has 16 divisors (see below), whose sum is σ = 106786962489600. Its totient is φ = 105215594291808.
The previous prime is 106000111055039. The next prime is 106000111055057. The reversal of 106000111055051 is 150550111000601.
It is a cyclic number.
It is not a de Polignac number, because 106000111055051 - 230 = 105999037313227 is a prime.
It is a super-2 number, since 2×1060001110550512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106000111055051.
It is not an unprimeable number, because it can be changed into a prime (106000111055057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220635485 + ... + 221115393.
It is an arithmetic number, because the mean of its divisors is an integer number (6674185155600).
Almost surely, 2106000111055051 is an apocalyptic number.
106000111055051 is a deficient number, since it is larger than the sum of its proper divisors (786851434549).
106000111055051 is a wasteful number, since it uses less digits than its factorization.
106000111055051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482338.
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 106000111055051 its reverse (150550111000601), we get a palindrome (256550222055652).
The spelling of 106000111055051 in words is "one hundred six trillion, one hundred eleven million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •