Base | Representation |
---|---|
bin | 101100100110100001011… |
… | …1100100100100011101111 |
3 | 210201000201010120112002110 |
4 | 1121031002330210203233 |
5 | 1300413311111143111 |
6 | 21012034023455103 |
7 | 1201611100035312 |
oct | 131150274444357 |
9 | 23630633515073 |
10 | 6130041506031 |
11 | 1a53810690693 |
12 | 8300625b7493 |
13 | 3560a2a077c1 |
14 | 1729a49c0979 |
15 | a96ca7995a6 |
hex | 59342f248ef |
6130041506031 has 48 divisors (see below), whose sum is σ = 8427194650368. Its totient is φ = 3962479449600.
The previous prime is 6130041506027. The next prime is 6130041506047. The reversal of 6130041506031 is 1306051400316.
It is not a de Polignac number, because 6130041506031 - 22 = 6130041506027 is a prime.
It is a super-2 number, since 2×61300415060312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6130041506031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6130041506021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 440337951 + ... + 440351871.
It is an arithmetic number, because the mean of its divisors is an integer number (175566555216).
Almost surely, 26130041506031 is an apocalyptic number.
6130041506031 is a deficient number, since it is larger than the sum of its proper divisors (2297153144337).
6130041506031 is a wasteful number, since it uses less digits than its factorization.
6130041506031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14380 (or 14241 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 6130041506031 its reverse (1306051400316), we get a palindrome (7436092906347).
The spelling of 6130041506031 in words is "six trillion, one hundred thirty billion, forty-one million, five hundred six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •