Base | Representation |
---|---|
bin | 1011100000101111… |
… | …0010111111001101 |
3 | 21222100120100112120 |
4 | 2320023302333031 |
5 | 22312031201143 |
6 | 1230343323153 |
7 | 136401263256 |
oct | 27013627715 |
9 | 7870510476 |
10 | 3090100173 |
11 | 134630aaa6 |
12 | 722a504b9 |
13 | 3a326cc54 |
14 | 21457bb2d |
15 | 131440383 |
hex | b82f2fcd |
3090100173 has 4 divisors (see below), whose sum is σ = 4120133568. Its totient is φ = 2060066780.
The previous prime is 3090100141. The next prime is 3090100199. The reversal of 3090100173 is 3710010903.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3710010903 = 3 ⋅1236670301.
It is a cyclic number.
It is not a de Polignac number, because 3090100173 - 25 = 3090100141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3090200173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 515016693 + ... + 515016698.
It is an arithmetic number, because the mean of its divisors is an integer number (1030033392).
Almost surely, 23090100173 is an apocalyptic number.
It is an amenable number.
3090100173 is a deficient number, since it is larger than the sum of its proper divisors (1030033395).
3090100173 is a wasteful number, since it uses less digits than its factorization.
3090100173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030033394.
The product of its (nonzero) digits is 567, while the sum is 24.
The square root of 3090100173 is about 55588.6694659982. The cubic root of 3090100173 is about 1456.5459370734.
The spelling of 3090100173 in words is "three billion, ninety million, one hundred thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •