Base | Representation |
---|---|
bin | 110001100001101001… |
… | …0010000001110010101 |
3 | 101011112002202002210200 |
4 | 1203003102100032111 |
5 | 3220304010313034 |
6 | 120505320411113 |
7 | 10453406214663 |
oct | 1430322201625 |
9 | 334462662720 |
10 | 106355557269 |
11 | 41117a37375 |
12 | 18742316a99 |
13 | a04c459010 |
14 | 520d185c33 |
15 | 2b771a7a99 |
hex | 18c3490395 |
106355557269 has 12 divisors (see below), whose sum is σ = 165441978156. Its totient is φ = 65449573632.
The previous prime is 106355557247. The next prime is 106355557307. The reversal of 106355557269 is 962755553601.
106355557269 is a `hidden beast` number, since 1 + 0 + 6 + 3 + 5 + 5 + 5 + 572 + 69 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 52374611025 + 53980946244 = 228855^2 + 232338^2 .
It is not a de Polignac number, because 106355557269 - 27 = 106355557141 is a prime.
It is a super-2 number, since 2×1063555572692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106355557769) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 454510812 + ... + 454511045.
It is an arithmetic number, because the mean of its divisors is an integer number (13786831513).
Almost surely, 2106355557269 is an apocalyptic number.
It is an amenable number.
106355557269 is a deficient number, since it is larger than the sum of its proper divisors (59086420887).
106355557269 is a wasteful number, since it uses less digits than its factorization.
106355557269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909021876 (or 909021873 counting only the distinct ones).
The product of its (nonzero) digits is 8505000, while the sum is 54.
The spelling of 106355557269 in words is "one hundred six billion, three hundred fifty-five million, five hundred fifty-seven thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •