Base | Representation |
---|---|
bin | 110001011001110100… |
… | …0010001100011000111 |
3 | 101010211210111110002112 |
4 | 1202303220101203013 |
5 | 3214234240110112 |
6 | 120423254531235 |
7 | 10444036503023 |
oct | 1426350214307 |
9 | 333753443075 |
10 | 106092894407 |
11 | 40aa2744925 |
12 | 1868a366b1b |
13 | a009c019c6 |
14 | 51c6331383 |
15 | 2b5e0c1a22 |
hex | 18b3a118c7 |
106092894407 has 4 divisors (see below), whose sum is σ = 106096470096. Its totient is φ = 106089318720.
The previous prime is 106092894371. The next prime is 106092894421. The reversal of 106092894407 is 704498290601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 704498290601 = 7 ⋅100642612943.
It is a cyclic number.
It is not a de Polignac number, because 106092894407 - 218 = 106092632263 is a prime.
It is a super-2 number, since 2×1060928944072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106092894487) 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 in 3 ways as a sum of consecutive naturals, for example, 1742963 + ... + 1802804.
It is an arithmetic number, because the mean of its divisors is an integer number (26524117524).
Almost surely, 2106092894407 is an apocalyptic number.
106092894407 is a deficient number, since it is larger than the sum of its proper divisors (3575689).
106092894407 is an equidigital number, since it uses as much as digits as its factorization.
106092894407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3575688.
The product of its (nonzero) digits is 870912, while the sum is 50.
The spelling of 106092894407 in words is "one hundred six billion, ninety-two million, eight hundred ninety-four thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •