Base | Representation |
---|---|
bin | 1011100001001100… |
… | …0111011110111011 |
3 | 21222111011211212002 |
4 | 2320103013132323 |
5 | 22313024103011 |
6 | 1230452411215 |
7 | 136423505015 |
oct | 27023073673 |
9 | 7874154762 |
10 | 3092019131 |
11 | 1347400813 |
12 | 723616b0b |
13 | 3a3792526 |
14 | 21491b1b5 |
15 | 1316bdc3b |
hex | b84c77bb |
3092019131 has 8 divisors (see below), whose sum is σ = 3263262720. Its totient is φ = 2921626152.
The previous prime is 3092019107. The next prime is 3092019137. The reversal of 3092019131 is 1319102903.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3092019131 - 26 = 3092019067 is a prime.
It is a super-2 number, since 2×30920191312 = 19121164612939990322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3092019094 and 3092019103.
It is not an unprimeable number, because it can be changed into a prime (3092019137) 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 7 ways as a sum of consecutive naturals, for example, 205175 + ... + 219728.
It is an arithmetic number, because the mean of its divisors is an integer number (407907840).
Almost surely, 23092019131 is an apocalyptic number.
3092019131 is a deficient number, since it is larger than the sum of its proper divisors (171243589).
3092019131 is a wasteful number, since it uses less digits than its factorization.
3092019131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425305.
The product of its (nonzero) digits is 1458, while the sum is 29.
The square root of 3092019131 is about 55605.9271211262. The cubic root of 3092019131 is about 1456.8473806021.
The spelling of 3092019131 in words is "three billion, ninety-two million, nineteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •