Base | Representation |
---|---|
bin | 1011011100001111… |
… | …11110000010001001 |
3 | 120212002021212201112 |
4 | 11232013332002021 |
5 | 100034443101103 |
6 | 2453304100105 |
7 | 305134546325 |
oct | 55607760211 |
9 | 16762255645 |
10 | 6142550153 |
11 | 2672344933 |
12 | 1235164635 |
13 | 76b789a7c |
14 | 423b18985 |
15 | 25e3e4cd8 |
hex | 16e1fe089 |
6142550153 has 4 divisors (see below), whose sum is σ = 6308565060. Its totient is φ = 5976535248.
The previous prime is 6142550107. The next prime is 6142550159. The reversal of 6142550153 is 3510552416.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4252735369 + 1889814784 = 65213^2 + 43472^2 .
It is a cyclic number.
It is not a de Polignac number, because 6142550153 - 210 = 6142549129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6142550159) 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, 83007398 + ... + 83007471.
It is an arithmetic number, because the mean of its divisors is an integer number (1577141265).
Almost surely, 26142550153 is an apocalyptic number.
It is an amenable number.
6142550153 is a deficient number, since it is larger than the sum of its proper divisors (166014907).
6142550153 is a wasteful number, since it uses less digits than its factorization.
6142550153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166014906.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 6142550153 is about 78374.4228240311. The cubic root of 6142550153 is about 1831.3987089989.
The spelling of 6142550153 in words is "six billion, one hundred forty-two million, five hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •