Base | Representation |
---|---|
bin | 10011111101111011000… |
… | …111011111110001111101 |
3 | 11212011210012100212121222 |
4 | 103331323013133301331 |
5 | 134440140443131143 |
6 | 2530210041403125 |
7 | 201064256443550 |
oct | 23757307376175 |
9 | 4764705325558 |
10 | 1372160130173 |
11 | 489a25692008 |
12 | 1a1b257994a5 |
13 | 9c517c23c11 |
14 | 4a5ad020697 |
15 | 25a5dec9768 |
hex | 13f7b1dfc7d |
1372160130173 has 8 divisors (see below), whose sum is σ = 1568215712448. Its totient is φ = 1176112724544.
The previous prime is 1372160130167. The next prime is 1372160130179. The reversal of 1372160130173 is 3710310612731.
It is an interprime number because it is at equal distance from previous prime (1372160130167) and next prime (1372160130179).
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 1372160130173 - 24 = 1372160130157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1372160130179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1680236 + ... + 2359557.
It is an arithmetic number, because the mean of its divisors is an integer number (196026964056).
Almost surely, 21372160130173 is an apocalyptic number.
It is an amenable number.
1372160130173 is a deficient number, since it is larger than the sum of its proper divisors (196055582275).
1372160130173 is an equidigital number, since it uses as much as digits as its factorization.
1372160130173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4088323.
The product of its (nonzero) digits is 15876, while the sum is 35.
The spelling of 1372160130173 in words is "one trillion, three hundred seventy-two billion, one hundred sixty million, one hundred thirty thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •