Base | Representation |
---|---|
bin | 1100001010100100… |
… | …10101100110111001 |
3 | 121212011111111102201 |
4 | 12011102111212321 |
5 | 101333433102441 |
6 | 3000025030201 |
7 | 320563544335 |
oct | 60522254671 |
9 | 17764444381 |
10 | 6531144121 |
11 | 285172a277 |
12 | 1323325361 |
13 | 801136828 |
14 | 45d5907c5 |
15 | 2835a3c31 |
hex | 1854959b9 |
6531144121 has 4 divisors (see below), whose sum is σ = 6628623952. Its totient is φ = 6433664292.
The previous prime is 6531144119. The next prime is 6531144131. The reversal of 6531144121 is 1214411356.
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 6531144121 - 21 = 6531144119 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6531144121.
It is not an unprimeable number, because it can be changed into a prime (6531144131) 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, 48739815 + ... + 48739948.
It is an arithmetic number, because the mean of its divisors is an integer number (1657155988).
Almost surely, 26531144121 is an apocalyptic number.
It is an amenable number.
6531144121 is a deficient number, since it is larger than the sum of its proper divisors (97479831).
6531144121 is an equidigital number, since it uses as much as digits as its factorization.
6531144121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97479830.
The product of its digits is 2880, while the sum is 28.
The square root of 6531144121 is about 80815.4943126626. The cubic root of 6531144121 is about 1869.2314915266.
Adding to 6531144121 its reverse (1214411356), we get a palindrome (7745555477).
The spelling of 6531144121 in words is "six billion, five hundred thirty-one million, one hundred forty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •