Base | Representation |
---|---|
bin | 11001001001100100… |
… | …00010111111001110 |
3 | 1021211222101201111220 |
4 | 30210302002333032 |
5 | 210123003013402 |
6 | 10111442424210 |
7 | 655410054462 |
oct | 144462027716 |
9 | 37758351456 |
10 | 13502001102 |
11 | 57a95892a7 |
12 | 2749962066 |
13 | 13723a7885 |
14 | 9212c24a2 |
15 | 540562dbc |
hex | 324c82fce |
13502001102 has 32 divisors (see below), whose sum is σ = 27244691712. Its totient is φ = 4460709504.
The previous prime is 13502001101. The next prime is 13502001133. The reversal of 13502001102 is 20110020531.
13502001102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13502001101) 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, 328278 + ... + 367110.
It is an arithmetic number, because the mean of its divisors is an integer number (851396616).
Almost surely, 213502001102 is an apocalyptic number.
13502001102 is an abundant number, since it is smaller than the sum of its proper divisors (13742690610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13502001102 is a wasteful number, since it uses less digits than its factorization.
13502001102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39352.
The product of its (nonzero) digits is 60, while the sum is 15.
Adding to 13502001102 its reverse (20110020531), we get a palindrome (33612021633).
The spelling of 13502001102 in words is "thirteen billion, five hundred two million, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •