Base | Representation |
---|---|
bin | 1011100001000110… |
… | …1010011100100101 |
3 | 21222110110111010002 |
4 | 2320101222130211 |
5 | 22312424404203 |
6 | 1230440311045 |
7 | 136420330010 |
oct | 27021523445 |
9 | 7873414102 |
10 | 3091638053 |
11 | 1347170479 |
12 | 723472485 |
13 | 3a368ac3a |
14 | 21485c377 |
15 | 131645d88 |
hex | b846a725 |
3091638053 has 4 divisors (see below), whose sum is σ = 3533300640. Its totient is φ = 2649975468.
The previous prime is 3091638047. The next prime is 3091638083. The reversal of 3091638053 is 3508361903.
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.
It is a de Polignac number, because none of the positive numbers 2k-3091638053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3091637998 and 3091638016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3091638083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220831283 + ... + 220831296.
It is an arithmetic number, because the mean of its divisors is an integer number (883325160).
Almost surely, 23091638053 is an apocalyptic number.
It is an amenable number.
3091638053 is a deficient number, since it is larger than the sum of its proper divisors (441662587).
3091638053 is an equidigital number, since it uses as much as digits as its factorization.
3091638053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441662586.
The product of its (nonzero) digits is 58320, while the sum is 38.
The square root of 3091638053 is about 55602.5004203948. The cubic root of 3091638053 is about 1456.7875280945.
Adding to 3091638053 its reverse (3508361903), we get a palindrome (6599999956).
The spelling of 3091638053 in words is "three billion, ninety-one million, six hundred thirty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •