Base | Representation |
---|---|
bin | 1011001101000011… |
… | …11001100111001010 |
3 | 120112012112021012202 |
4 | 11212201321213022 |
5 | 44304333130213 |
6 | 2432513040202 |
7 | 302026522220 |
oct | 54641714712 |
9 | 16465467182 |
10 | 6015130058 |
11 | 2607425273 |
12 | 11ba556062 |
13 | 74b265672 |
14 | 410c2ab10 |
15 | 253125b58 |
hex | 1668799ca |
6015130058 has 8 divisors (see below), whose sum is σ = 10311651552. Its totient is φ = 2577912876.
The previous prime is 6015130057. The next prime is 6015130109. The reversal of 6015130058 is 8500315106.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×60151300582 = 72363579229310166728, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6015130058.
It is not an unprimeable number, because it can be changed into a prime (6015130057) 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 3 ways as a sum of consecutive naturals, for example, 214826060 + ... + 214826087.
It is an arithmetic number, because the mean of its divisors is an integer number (1288956444).
Almost surely, 26015130058 is an apocalyptic number.
6015130058 is a deficient number, since it is larger than the sum of its proper divisors (4296521494).
6015130058 is a wasteful number, since it uses less digits than its factorization.
6015130058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429652156.
The product of its (nonzero) digits is 3600, while the sum is 29.
The square root of 6015130058 is about 77557.2695367752. The cubic root of 6015130058 is about 1818.6467074256.
It can be divided in two parts, 60151 and 30058, that added together give a palindrome (90209).
The spelling of 6015130058 in words is "six billion, fifteen million, one hundred thirty thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •