Base | Representation |
---|---|
bin | 11000001110000101… |
… | …11110000101110101 |
3 | 1020120012122222200120 |
4 | 30013002332011311 |
5 | 203112244333023 |
6 | 5550142002153 |
7 | 640141463541 |
oct | 140702760565 |
9 | 36505588616 |
10 | 13003121013 |
11 | 5572a17303 |
12 | 262a876359 |
13 | 12c2c2545c |
14 | 8b4d3ca21 |
15 | 51186b8e3 |
hex | 3070be175 |
13003121013 has 16 divisors (see below), whose sum is σ = 17831161152. Its totient is φ = 8423600000.
The previous prime is 13003120993. The next prime is 13003121069. The reversal of 13003121013 is 31012130031.
13003121013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13003121013 - 25 = 13003120981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13003120983 and 13003121001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13003121513) 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 in 15 ways as a sum of consecutive naturals, for example, 179718 + ... + 241463.
It is an arithmetic number, because the mean of its divisors is an integer number (1114447572).
Almost surely, 213003121013 is an apocalyptic number.
It is an amenable number.
13003121013 is a deficient number, since it is larger than the sum of its proper divisors (4828040139).
13003121013 is a wasteful number, since it uses less digits than its factorization.
13003121013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421476.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13003121013 its reverse (31012130031), we get a palindrome (44015251044).
The spelling of 13003121013 in words is "thirteen billion, three million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •