Base | Representation |
---|---|
bin | 1101010110100111… |
… | …11110010011001001 |
3 | 200111121221101011212 |
4 | 12223103332103021 |
5 | 104140242412040 |
6 | 3143214502505 |
7 | 342441256004 |
oct | 65323762311 |
9 | 20447841155 |
10 | 7169107145 |
11 | 3049857342 |
12 | 1480b04a35 |
13 | 8a3364a45 |
14 | 4c01ba53b |
15 | 2be5bed65 |
hex | 1ab4fe4c9 |
7169107145 has 8 divisors (see below), whose sum is σ = 9108983304. Its totient is φ = 5397915904.
The previous prime is 7169107129. The next prime is 7169107147. The reversal of 7169107145 is 5417019617.
It can be written as a sum of positive squares in 4 ways, for example, as 151191616 + 7017915529 = 12296^2 + 83773^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 7169107145 - 24 = 7169107129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (7169107147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42171134 + ... + 42171303.
It is an arithmetic number, because the mean of its divisors is an integer number (1138622913).
Almost surely, 27169107145 is an apocalyptic number.
It is an amenable number.
7169107145 is a deficient number, since it is larger than the sum of its proper divisors (1939876159).
7169107145 is a wasteful number, since it uses less digits than its factorization.
7169107145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84342459.
The product of its (nonzero) digits is 52920, while the sum is 41.
The square root of 7169107145 is about 84670.5801621791. The cubic root of 7169107145 is about 1928.2130762057.
The spelling of 7169107145 in words is "seven billion, one hundred sixty-nine million, one hundred seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •