Base | Representation |
---|---|
bin | 11001001101000010… |
… | …11100000111011101 |
3 | 1021221000100021122010 |
4 | 30212201130013131 |
5 | 210202441431023 |
6 | 10114404341433 |
7 | 656213214360 |
oct | 144641340735 |
9 | 37830307563 |
10 | 13531202013 |
11 | 581401338a |
12 | 27576a4879 |
13 | 137845cc14 |
14 | 9251240d7 |
15 | 542dd0093 |
hex | 32685c1dd |
13531202013 has 128 divisors (see below), whose sum is σ = 23438131200. Its totient is φ = 6766924032.
The previous prime is 13531201951. The next prime is 13531202029. The reversal of 13531202013 is 31020213531.
13531202013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13531202013 - 212 = 13531197917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13531202033) 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 127 ways as a sum of consecutive naturals, for example, 36276495 + ... + 36276867.
It is an arithmetic number, because the mean of its divisors is an integer number (183110400).
Almost surely, 213531202013 is an apocalyptic number.
It is an amenable number.
13531202013 is a deficient number, since it is larger than the sum of its proper divisors (9906929187).
13531202013 is a wasteful number, since it uses less digits than its factorization.
13531202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 13531202013 its reverse (31020213531), we get a palindrome (44551415544).
The spelling of 13531202013 in words is "thirteen billion, five hundred thirty-one million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •