Base | Representation |
---|---|
bin | 11000010010101000… |
… | …01110111111001001 |
3 | 1020122212022122202001 |
4 | 30021110032333021 |
5 | 203202021413342 |
6 | 5554022111001 |
7 | 641113244311 |
oct | 141124167711 |
9 | 36585278661 |
10 | 13041201097 |
11 | 5592466451 |
12 | 263b57b461 |
13 | 12caa99152 |
14 | 8ba012441 |
15 | 514d8e8b7 |
hex | 30950efc9 |
13041201097 has 2 divisors, whose sum is σ = 13041201098. Its totient is φ = 13041201096.
The previous prime is 13041201091. The next prime is 13041201127. The reversal of 13041201097 is 79010214031.
13041201097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12737605321 + 303595776 = 112861^2 + 17424^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13041201097 is a prime.
It is not a weakly prime, because it can be changed into another prime (13041201091) 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 as a sum of consecutive naturals, namely, 6520600548 + 6520600549.
It is an arithmetic number, because the mean of its divisors is an integer number (6520600549).
Almost surely, 213041201097 is an apocalyptic number.
It is an amenable number.
13041201097 is a deficient number, since it is larger than the sum of its proper divisors (1).
13041201097 is an equidigital number, since it uses as much as digits as its factorization.
13041201097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The spelling of 13041201097 in words is "thirteen billion, forty-one million, two hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •