Base | Representation |
---|---|
bin | 11000101011001000… |
… | …10001001100011101 |
3 | 1021012012001122211001 |
4 | 30111210101030131 |
5 | 204112130343122 |
6 | 10030243230301 |
7 | 646160233051 |
oct | 142544211435 |
9 | 37165048731 |
10 | 13246731037 |
11 | 5688486101 |
12 | 2698378391 |
13 | 133153b4b7 |
14 | 8d9433c61 |
15 | 527e3c527 |
hex | 31591131d |
13246731037 has 4 divisors (see below), whose sum is σ = 13428193180. Its totient is φ = 13065268896.
The previous prime is 13246730941. The next prime is 13246731061. The reversal of 13246731037 is 73013764231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 73013764231 = 43 ⋅1697994517.
It can be written as a sum of positive squares in 2 ways, for example, as 7898587876 + 5348143161 = 88874^2 + 73131^2 .
It is a cyclic number.
It is not a de Polignac number, because 13246731037 - 219 = 13246206749 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13246730987 and 13246731005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13246731097) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90730962 + ... + 90731107.
It is an arithmetic number, because the mean of its divisors is an integer number (3357048295).
Almost surely, 213246731037 is an apocalyptic number.
It is an amenable number.
13246731037 is a deficient number, since it is larger than the sum of its proper divisors (181462143).
13246731037 is an equidigital number, since it uses as much as digits as its factorization.
13246731037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181462142.
The product of its (nonzero) digits is 63504, while the sum is 37.
The spelling of 13246731037 in words is "thirteen billion, two hundred forty-six million, seven hundred thirty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •