Base | Representation |
---|---|
bin | 11000000111010100000011… |
… | …001010001100001010101011 |
3 | 111220111211020201102122202110 |
4 | 120013110003022030022223 |
5 | 102400104013143134201 |
6 | 1013321150150533403 |
7 | 31224161425462563 |
oct | 3007240312141253 |
9 | 456454221378673 |
10 | 106055680443051 |
11 | 30879a63820609 |
12 | ba8a374967263 |
13 | 4724014056b61 |
14 | 1c2919d919da3 |
15 | c3db41b616d6 |
hex | 60750328c2ab |
106055680443051 has 4 divisors (see below), whose sum is σ = 141407573924072. Its totient is φ = 70703786962032.
The previous prime is 106055680443049. The next prime is 106055680443103. The reversal of 106055680443051 is 150344086550601.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 106055680443051 - 21 = 106055680443049 is a prime.
It is a super-2 number, since 2×1060556804430512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106055680443451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17675946740506 + ... + 17675946740511.
It is an arithmetic number, because the mean of its divisors is an integer number (35351893481018).
Almost surely, 2106055680443051 is an apocalyptic number.
106055680443051 is a deficient number, since it is larger than the sum of its proper divisors (35351893481021).
106055680443051 is an equidigital number, since it uses as much as digits as its factorization.
106055680443051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35351893481020.
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 106055680443051 in words is "one hundred six trillion, fifty-five billion, six hundred eighty million, four hundred forty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •