Base | Representation |
---|---|
bin | 1011011110010101… |
… | …01100000011011001 |
3 | 120220022012110111022 |
4 | 11233022230003121 |
5 | 100103432241103 |
6 | 2455131012225 |
7 | 305436322511 |
oct | 55712540331 |
9 | 16808173438 |
10 | 6160040153 |
11 | 2681200383 |
12 | 123ab9a075 |
13 | 7722a1897 |
14 | 42618c841 |
15 | 260bec138 |
hex | 16f2ac0d9 |
6160040153 has 4 divisors (see below), whose sum is σ = 6160268160. Its totient is φ = 6159812148.
The previous prime is 6160040149. The next prime is 6160040167. The reversal of 6160040153 is 3510400616.
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 6160040153 - 22 = 6160040149 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6160040753) 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, 67025 + ... + 129662.
It is an arithmetic number, because the mean of its divisors is an integer number (1540067040).
Almost surely, 26160040153 is an apocalyptic number.
It is an amenable number.
6160040153 is a deficient number, since it is larger than the sum of its proper divisors (228007).
6160040153 is a wasteful number, since it uses less digits than its factorization.
6160040153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228006.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 6160040153 is about 78485.9232792735. The cubic root of 6160040153 is about 1833.1352738509.
Adding to 6160040153 its reverse (3510400616), we get a palindrome (9670440769).
The spelling of 6160040153 in words is "six billion, one hundred sixty million, forty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •