Base | Representation |
---|---|
bin | 11000011001010111… |
… | …00000001100111001 |
3 | 1020210210111200011120 |
4 | 30030223200030321 |
5 | 203310443220234 |
6 | 10003355415453 |
7 | 642400016460 |
oct | 141453401471 |
9 | 36723450146 |
10 | 13097632569 |
11 | 56112aa22a |
12 | 2656454589 |
13 | 1309696a58 |
14 | 8c37019d7 |
15 | 519cda049 |
hex | 30cae0339 |
13097632569 has 16 divisors (see below), whose sum is σ = 19978632192. Its totient is φ = 7476735888.
The previous prime is 13097632549. The next prime is 13097632571. The reversal of 13097632569 is 96523679031.
It is a happy number.
It is not a de Polignac number, because 13097632569 - 29 = 13097632057 is a prime.
It is a super-2 number, since 2×130976325692 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13097632519) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 296599 + ... + 337884.
It is an arithmetic number, because the mean of its divisors is an integer number (1248664512).
Almost surely, 213097632569 is an apocalyptic number.
It is an amenable number.
13097632569 is a deficient number, since it is larger than the sum of its proper divisors (6880999623).
13097632569 is an equidigital number, since it uses as much as digits as its factorization.
13097632569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 635476.
The product of its (nonzero) digits is 1837080, while the sum is 51.
The spelling of 13097632569 in words is "thirteen billion, ninety-seven million, six hundred thirty-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •