Base | Representation |
---|---|
bin | 1011011010111010… |
… | …01011110111110001 |
3 | 120211022012001221012 |
4 | 11231131023313301 |
5 | 100024110202031 |
6 | 2452223440305 |
7 | 304640325125 |
oct | 55535136761 |
9 | 16738161835 |
10 | 6131334641 |
11 | 2666a84513 |
12 | 1231456095 |
13 | 769360b83 |
14 | 422439585 |
15 | 25d42bb2b |
hex | 16d74bdf1 |
6131334641 has 4 divisors (see below), whose sum is σ = 6397914432. Its totient is φ = 5864754852.
The previous prime is 6131334617. The next prime is 6131334647. The reversal of 6131334641 is 1464331316.
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 cyclic number.
It is not a de Polignac number, because 6131334641 - 210 = 6131333617 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6131334598 and 6131334607.
It is not an unprimeable number, because it can be changed into a prime (6131334647) 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, 133289861 + ... + 133289906.
It is an arithmetic number, because the mean of its divisors is an integer number (1599478608).
Almost surely, 26131334641 is an apocalyptic number.
It is an amenable number.
6131334641 is a deficient number, since it is larger than the sum of its proper divisors (266579791).
6131334641 is a wasteful number, since it uses less digits than its factorization.
6131334641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266579790.
The product of its digits is 15552, while the sum is 32.
The square root of 6131334641 is about 78302.8392907946. The cubic root of 6131334641 is about 1830.2833965437.
Adding to 6131334641 its reverse (1464331316), we get a palindrome (7595665957).
The spelling of 6131334641 in words is "six billion, one hundred thirty-one million, three hundred thirty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •