Base | Representation |
---|---|
bin | 110001100011100111… |
… | …1111011010110001111 |
3 | 101011200201212121101001 |
4 | 1203013033323112033 |
5 | 3220423021300320 |
6 | 120520054001131 |
7 | 10455144360550 |
oct | 1430717732617 |
9 | 334621777331 |
10 | 106422056335 |
11 | 41151527081 |
12 | 187606461a7 |
13 | a06017018a |
14 | 5217d36327 |
15 | 2b7ce4120a |
hex | 18c73fb58f |
106422056335 has 32 divisors (see below), whose sum is σ = 147219835392. Its totient is φ = 72342787200.
The previous prime is 106422056311. The next prime is 106422056381. The reversal of 106422056335 is 533650224601.
It is not a de Polignac number, because 106422056335 - 219 = 106421532047 is a prime.
It is a super-2 number, since 2×1064220563352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106422056294 and 106422056303.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2075760 + ... + 2126410.
It is an arithmetic number, because the mean of its divisors is an integer number (4600619856).
Almost surely, 2106422056335 is an apocalyptic number.
106422056335 is a deficient number, since it is larger than the sum of its proper divisors (40797779057).
106422056335 is a wasteful number, since it uses less digits than its factorization.
106422056335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51183.
The product of its (nonzero) digits is 129600, while the sum is 37.
The spelling of 106422056335 in words is "one hundred six billion, four hundred twenty-two million, fifty-six thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •