Base | Representation |
---|---|
bin | 11000100110111000… |
… | …00000001110110001 |
3 | 1021002200211211201112 |
4 | 30103130000032301 |
5 | 204024004304334 |
6 | 10022525443105 |
7 | 645244506023 |
oct | 142334001661 |
9 | 37080754645 |
10 | 13211009969 |
11 | 566a2a8363 |
12 | 2688410495 |
13 | 1327012481 |
14 | 8d47b6013 |
15 | 524c334ce |
hex | 3137003b1 |
13211009969 has 2 divisors, whose sum is σ = 13211009970. Its totient is φ = 13211009968.
The previous prime is 13211009923. The next prime is 13211009989. The reversal of 13211009969 is 96990011231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10673369344 + 2537640625 = 103312^2 + 50375^2 .
It is a cyclic number.
It is not a de Polignac number, because 13211009969 - 216 = 13210944433 is a prime.
It is a super-2 number, since 2×132110099692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13211009989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605504984 + 6605504985.
It is an arithmetic number, because the mean of its divisors is an integer number (6605504985).
Almost surely, 213211009969 is an apocalyptic number.
It is an amenable number.
13211009969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211009969 is an equidigital number, since it uses as much as digits as its factorization.
13211009969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26244, while the sum is 41.
The spelling of 13211009969 in words is "thirteen billion, two hundred eleven million, nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •