Base | Representation |
---|---|
bin | 1011011010111010… |
… | …11100101000111001 |
3 | 120211022022120010220 |
4 | 11231131130220321 |
5 | 100024114401241 |
6 | 2452225130253 |
7 | 304641032301 |
oct | 55535345071 |
9 | 16738276126 |
10 | 6131403321 |
11 | 266702107a |
12 | 1231489989 |
13 | 769386204 |
14 | 422456601 |
15 | 25d442166 |
hex | 16d75ca39 |
6131403321 has 8 divisors (see below), whose sum is σ = 8178338784. Its totient is φ = 4086035040.
The previous prime is 6131403233. The next prime is 6131403331. The reversal of 6131403321 is 1233041316.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6131403321 - 213 = 6131395129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6131403291 and 6131403300.
It is not an unprimeable number, because it can be changed into a prime (6131403331) 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, 382635 + ... + 398336.
It is an arithmetic number, because the mean of its divisors is an integer number (1022292348).
Almost surely, 26131403321 is an apocalyptic number.
It is an amenable number.
6131403321 is a deficient number, since it is larger than the sum of its proper divisors (2046935463).
6131403321 is a wasteful number, since it uses less digits than its factorization.
6131403321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783591.
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 6131403321 is about 78303.2778432678. The cubic root of 6131403321 is about 1830.2902304769.
Adding to 6131403321 its reverse (1233041316), we get a palindrome (7364444637).
The spelling of 6131403321 in words is "six billion, one hundred thirty-one million, four hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •