Base | Representation |
---|---|
bin | 1011011010110001… |
… | …01111000101000011 |
3 | 120211012222210210010 |
4 | 11231120233011003 |
5 | 100023310340011 |
6 | 2452142440003 |
7 | 304624366203 |
oct | 55530570503 |
9 | 16735883703 |
10 | 6130168131 |
11 | 266635805a |
12 | 1230b93003 |
13 | 769042c29 |
14 | 422214403 |
15 | 25d29b1a6 |
hex | 16d62f143 |
6130168131 has 8 divisors (see below), whose sum is σ = 8232360640. Its totient is φ = 4057377192.
The previous prime is 6130168087. The next prime is 6130168133. The reversal of 6130168131 is 1318610316.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6130168131 - 27 = 6130168003 is a prime.
It is a super-2 number, since 2×61301681312 = 75157922628656066322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6130168133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7349905 + ... + 7350738.
It is an arithmetic number, because the mean of its divisors is an integer number (1029045080).
Almost surely, 26130168131 is an apocalyptic number.
6130168131 is a deficient number, since it is larger than the sum of its proper divisors (2102192509).
6130168131 is a wasteful number, since it uses less digits than its factorization.
6130168131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14700785.
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 6130168131 is about 78295.3902282887. The cubic root of 6130168131 is about 1830.1673163630.
Adding to 6130168131 its reverse (1318610316), we get a palindrome (7448778447).
The spelling of 6130168131 in words is "six billion, one hundred thirty million, one hundred sixty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •