Base | Representation |
---|---|
bin | 11000011001111000… |
… | …01010101111011011 |
3 | 1020211002201121200120 |
4 | 30030330022233123 |
5 | 203313103013430 |
6 | 10004033204323 |
7 | 642452112660 |
oct | 141474125733 |
9 | 36732647616 |
10 | 13102001115 |
11 | 56138133a5 |
12 | 2657a006a3 |
13 | 130a5662a8 |
14 | 8c411ba67 |
15 | 51a39e610 |
hex | 30cf0abdb |
13102001115 has 16 divisors (see below), whose sum is σ = 23957945088. Its totient is φ = 5989486176.
The previous prime is 13102001071. The next prime is 13102001149. The reversal of 13102001115 is 51110020131.
It is not a de Polignac number, because 13102001115 - 29 = 13102000603 is a prime.
It is a super-2 number, since 2×131020011152 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 13102001094 and 13102001103.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 62390377 + ... + 62390586.
It is an arithmetic number, because the mean of its divisors is an integer number (1497371568).
Almost surely, 213102001115 is an apocalyptic number.
13102001115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13102001115 is a deficient number, since it is larger than the sum of its proper divisors (10855943973).
13102001115 is a wasteful number, since it uses less digits than its factorization.
13102001115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124780978.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 13102001115 its reverse (51110020131), we get a palindrome (64212021246).
The spelling of 13102001115 in words is "thirteen billion, one hundred two million, one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •