Base | Representation |
---|---|
bin | 11000100001111011… |
… | …11011001001000001 |
3 | 1020222210212111021112 |
4 | 30100331323021001 |
5 | 203432402222434 |
6 | 10014445333105 |
7 | 644232333614 |
oct | 142075731101 |
9 | 36883774245 |
10 | 13169570369 |
11 | 564897415a |
12 | 2676567195 |
13 | 131b5635b7 |
14 | 8cd0aa17b |
15 | 521299dce |
hex | 310f7b241 |
13169570369 has 2 divisors, whose sum is σ = 13169570370. Its totient is φ = 13169570368.
The previous prime is 13169570303. The next prime is 13169570371. The reversal of 13169570369 is 96307596131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7693570369 + 5476000000 = 87713^2 + 74000^2 .
It is a cyclic number.
It is not a de Polignac number, because 13169570369 - 216 = 13169504833 is a prime.
It is a super-2 number, since 2×131695703692 (a number of 21 digits) contains 22 as substring.
Together with 13169570371, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13169570669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6584785184 + 6584785185.
It is an arithmetic number, because the mean of its divisors is an integer number (6584785185).
Almost surely, 213169570369 is an apocalyptic number.
It is an amenable number.
13169570369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13169570369 is an equidigital number, since it uses as much as digits as its factorization.
13169570369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 918540, while the sum is 50.
The spelling of 13169570369 in words is "thirteen billion, one hundred sixty-nine million, five hundred seventy thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •