Base | Representation |
---|---|
bin | 110001110010100100… |
… | …1100011000011011001 |
3 | 101012222200210202201101 |
4 | 1203211021203003121 |
5 | 3222434431403231 |
6 | 121041533551401 |
7 | 10503445313035 |
oct | 1434511430331 |
9 | 335880722641 |
10 | 106923700441 |
11 | 41389706788 |
12 | 18880645561 |
13 | a11007c6cc |
14 | 52647d91c5 |
15 | 2babed1661 |
hex | 18e52630d9 |
106923700441 has 2 divisors, whose sum is σ = 106923700442. Its totient is φ = 106923700440.
The previous prime is 106923700421. The next prime is 106923700447. The reversal of 106923700441 is 144007329601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105082947225 + 1840753216 = 324165^2 + 42904^2 .
It is a cyclic number.
It is not a de Polignac number, because 106923700441 - 25 = 106923700409 is a prime.
It is a super-2 number, since 2×1069237004412 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106923700441.
It is not a weakly prime, because it can be changed into another prime (106923700447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53461850220 + 53461850221.
It is an arithmetic number, because the mean of its divisors is an integer number (53461850221).
Almost surely, 2106923700441 is an apocalyptic number.
It is an amenable number.
106923700441 is a deficient number, since it is larger than the sum of its proper divisors (1).
106923700441 is an equidigital number, since it uses as much as digits as its factorization.
106923700441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 37.
The spelling of 106923700441 in words is "one hundred six billion, nine hundred twenty-three million, seven hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •