Base | Representation |
---|---|
bin | 1011111000110011001000… |
… | …0001000100110000101101 |
3 | 1201021112001100212010000022 |
4 | 2332030302001010300231 |
5 | 3203121212200433143 |
6 | 43444245320411525 |
7 | 2516210210131400 |
oct | 276146201046055 |
9 | 51245040763008 |
10 | 13070424624173 |
11 | 418a154a56234 |
12 | 1571176916ba5 |
13 | 73a6c7086477 |
14 | 33287d1b1d37 |
15 | 179ed21c2268 |
hex | be332044c2d |
13070424624173 has 12 divisors (see below), whose sum is σ = 15204430644732. Its totient is φ = 11203177527360.
The previous prime is 13070424624163. The next prime is 13070424624277. The reversal of 13070424624173 is 37142642407031.
It can be written as a sum of positive squares in 2 ways, for example, as 7174667602249 + 5895757021924 = 2678557^2 + 2428118^2 .
It is not a de Polignac number, because 13070424624173 - 210 = 13070424623149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13070424624163) 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 11 ways as a sum of consecutive naturals, for example, 22732193 + ... + 23300073.
It is an arithmetic number, because the mean of its divisors is an integer number (1267035887061).
Almost surely, 213070424624173 is an apocalyptic number.
It is an amenable number.
13070424624173 is a deficient number, since it is larger than the sum of its proper divisors (2134006020559).
13070424624173 is an equidigital number, since it uses as much as digits as its factorization.
13070424624173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1037612 (or 1037605 counting only the distinct ones).
The product of its (nonzero) digits is 677376, while the sum is 44.
The spelling of 13070424624173 in words is "thirteen trillion, seventy billion, four hundred twenty-four million, six hundred twenty-four thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •