Base | Representation |
---|---|
bin | 110001110011010111… |
… | …1000110001110011101 |
3 | 101020001112220020022222 |
4 | 1203212233012032131 |
5 | 3223013240233203 |
6 | 121044324315125 |
7 | 10504220505122 |
oct | 1434657061635 |
9 | 336045806288 |
10 | 106950321053 |
11 | 413a2739194 |
12 | 18889542aa5 |
13 | a115740454 |
14 | 5268168749 |
15 | 2bae4de038 |
hex | 18e6bc639d |
106950321053 has 4 divisors (see below), whose sum is σ = 107043080508. Its totient is φ = 106857561600.
The previous prime is 106950321041. The next prime is 106950321131. The reversal of 106950321053 is 350123059601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83242636324 + 23707684729 = 288518^2 + 153973^2 .
It is a cyclic number.
It is not a de Polignac number, because 106950321053 - 26 = 106950320989 is a prime.
It is a super-2 number, since 2×1069503210532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106950321353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46377998 + ... + 46380303.
It is an arithmetic number, because the mean of its divisors is an integer number (26760770127).
Almost surely, 2106950321053 is an apocalyptic number.
It is an amenable number.
106950321053 is a deficient number, since it is larger than the sum of its proper divisors (92759455).
106950321053 is an equidigital number, since it uses as much as digits as its factorization.
106950321053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92759454.
The product of its (nonzero) digits is 24300, while the sum is 35.
The spelling of 106950321053 in words is "one hundred six billion, nine hundred fifty million, three hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •