Base | Representation |
---|---|
bin | 11000100000000000… |
… | …01000001111110001 |
3 | 1020221200101111002101 |
4 | 30100000020033301 |
5 | 203414230333441 |
6 | 10013110220401 |
7 | 643644544522 |
oct | 142000101761 |
9 | 36850344071 |
10 | 13153371121 |
11 | 563a80a450 |
12 | 2671054701 |
13 | 13180b1147 |
14 | 8cac90849 |
15 | 51eb4a231 |
hex | 3100083f1 |
13153371121 has 16 divisors (see below), whose sum is σ = 15261378048. Its totient is φ = 11203718400.
The previous prime is 13153371113. The next prime is 13153371139. The reversal of 13153371121 is 12117335131.
It is a cyclic number.
It is not a de Polignac number, because 13153371121 - 23 = 13153371113 is a prime.
It is a super-2 number, since 2×131533711212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13153371121.
It is not an unprimeable number, because it can be changed into a prime (13153371181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 116010 + ... + 199411.
It is an arithmetic number, because the mean of its divisors is an integer number (953836128).
Almost surely, 213153371121 is an apocalyptic number.
13153371121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13153371121 is a deficient number, since it is larger than the sum of its proper divisors (2108006927).
13153371121 is a wasteful number, since it uses less digits than its factorization.
13153371121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315672.
The product of its digits is 1890, while the sum is 28.
The spelling of 13153371121 in words is "thirteen billion, one hundred fifty-three million, three hundred seventy-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •