Base | Representation |
---|---|
bin | 1011010000001000… |
… | …10100011101101001 |
3 | 120121000002001021211 |
4 | 11220010110131221 |
5 | 44332434231103 |
6 | 2435234033121 |
7 | 302462026156 |
oct | 55004243551 |
9 | 16530061254 |
10 | 6040930153 |
11 | 261aa47265 |
12 | 12071187a1 |
13 | 7536c9aab |
14 | 41442522d |
15 | 25552036d |
hex | 168114769 |
6040930153 has 4 divisors (see below), whose sum is σ = 6113712528. Its totient is φ = 5968147780.
The previous prime is 6040930117. The next prime is 6040930183. The reversal of 6040930153 is 3510390406.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3510390406 = 2 ⋅1755195203.
It is a cyclic number.
It is not a de Polignac number, because 6040930153 - 29 = 6040929641 is a prime.
It is a super-2 number, since 2×60409301532 = 72985674226849206818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6040930183) 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, 36391063 + ... + 36391228.
It is an arithmetic number, because the mean of its divisors is an integer number (1528428132).
Almost surely, 26040930153 is an apocalyptic number.
It is an amenable number.
6040930153 is a deficient number, since it is larger than the sum of its proper divisors (72782375).
6040930153 is an equidigital number, since it uses as much as digits as its factorization.
6040930153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72782374.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 6040930153 is about 77723.4208781369. The cubic root of 6040930153 is about 1821.2431784294.
The spelling of 6040930153 in words is "six billion, forty million, nine hundred thirty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •