Base | Representation |
---|---|
bin | 11000001110111101… |
… | …00111010111100001 |
3 | 1020120201022011122100 |
4 | 30013132213113201 |
5 | 203121123233334 |
6 | 5551001201013 |
7 | 640260205644 |
oct | 140736472741 |
9 | 36521264570 |
10 | 13010367969 |
11 | 5577017025 |
12 | 2631190169 |
13 | 12c4591bb1 |
14 | 8b5ca7a5b |
15 | 5122edc99 |
hex | 3077a75e1 |
13010367969 has 27 divisors (see below), whose sum is σ = 18987008313. Its totient is φ = 8584837632.
The previous prime is 13010367961. The next prime is 13010368013. The reversal of 13010367969 is 96976301031.
The square root of 13010367969 is 114063.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1719180369 + 11291187600 = 41463^2 + 106260^2 .
It is not a de Polignac number, because 13010367969 - 23 = 13010367961 is a prime.
It is a super-2 number, since 2×130103679692 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13010367961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 66042379 + ... + 66042575.
Almost surely, 213010367969 is an apocalyptic number.
13010367969 is the 114063-rd square number.
13010367969 is the 57032-nd centered octagonal number.
It is an amenable number.
13010367969 is a deficient number, since it is larger than the sum of its proper divisors (5976640344).
13010367969 is an frugal number, since it uses more digits than its factorization.
13010367969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786 (or 393 counting only the distinct ones).
The product of its (nonzero) digits is 183708, while the sum is 45.
The spelling of 13010367969 in words is "thirteen billion, ten million, three hundred sixty-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •