Base | Representation |
---|---|
bin | 110001100011010010… |
… | …1111111000001101111 |
3 | 101011122222012000002201 |
4 | 1203012211333001233 |
5 | 3220412212430414 |
6 | 120515022202331 |
7 | 10454652045331 |
oct | 1430645770157 |
9 | 334588160081 |
10 | 106411061359 |
11 | 411462a7419 |
12 | 18758a233a7 |
13 | a05aac0785 |
14 | 52166b3451 |
15 | 2b7bebd574 |
hex | 18c697f06f |
106411061359 has 2 divisors, whose sum is σ = 106411061360. Its totient is φ = 106411061358.
The previous prime is 106411061357. The next prime is 106411061387. The reversal of 106411061359 is 953160114601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106411061359 - 21 = 106411061357 is a prime.
It is a super-2 number, since 2×1064110613592 (a number of 23 digits) contains 22 as substring.
Together with 106411061357, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106411061357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53205530679 + 53205530680.
It is an arithmetic number, because the mean of its divisors is an integer number (53205530680).
Almost surely, 2106411061359 is an apocalyptic number.
106411061359 is a deficient number, since it is larger than the sum of its proper divisors (1).
106411061359 is an equidigital number, since it uses as much as digits as its factorization.
106411061359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 37.
The spelling of 106411061359 in words is "one hundred six billion, four hundred eleven million, sixty-one thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •