Base | Representation |
---|---|
bin | 1110111000011000… |
… | …01111110001100001 |
3 | 202121210000122021200 |
4 | 13130030033301201 |
5 | 112330211241103 |
6 | 3400431311413 |
7 | 401656532454 |
oct | 73414176141 |
9 | 22553018250 |
10 | 7989165153 |
11 | 342a748032 |
12 | 166b67b569 |
13 | 9a421b578 |
14 | 55b08749b |
15 | 31b5aa0a3 |
hex | 1dc30fc61 |
7989165153 has 12 divisors (see below), whose sum is σ = 11541973248. Its totient is φ = 5325155640.
The previous prime is 7989165143. The next prime is 7989165169. The reversal of 7989165153 is 3515619897.
It is not a de Polignac number, because 7989165153 - 212 = 7989161057 is a prime.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 7989165153.
It is not an unprimeable number, because it can be changed into a prime (7989165143) 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 11 ways as a sum of consecutive naturals, for example, 24525 + ... + 128762.
It is an arithmetic number, because the mean of its divisors is an integer number (961831104).
Almost surely, 27989165153 is an apocalyptic number.
It is an amenable number.
7989165153 is a deficient number, since it is larger than the sum of its proper divisors (3552808095).
7989165153 is a wasteful number, since it uses less digits than its factorization.
7989165153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159084 (or 159081 counting only the distinct ones).
The product of its digits is 2041200, while the sum is 54.
The square root of 7989165153 is about 89382.1299421758. The cubic root of 7989165153 is about 1999.0966881586.
The spelling of 7989165153 in words is "seven billion, nine hundred eighty-nine million, one hundred sixty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •