Base | Representation |
---|---|
bin | 11000111001111101… |
… | …01111011010010101 |
3 | 1021111212002211010121 |
4 | 30130332233122111 |
5 | 204341001023221 |
6 | 10050445151541 |
7 | 652230366040 |
oct | 143476573225 |
9 | 37455084117 |
10 | 13371111061 |
11 | 5741709710 |
12 | 2711b5b5b1 |
13 | 1351239c49 |
14 | 90bb6dc57 |
15 | 533d0aa41 |
hex | 31cfaf695 |
13371111061 has 8 divisors (see below), whose sum is σ = 16670476224. Its totient is φ = 10419047520.
The previous prime is 13371111041. The next prime is 13371111077. The reversal of 13371111061 is 16011117331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13371111061 - 211 = 13371109013 is a prime.
It is a super-2 number, since 2×133711110612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13371111041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86825320 + ... + 86825473.
It is an arithmetic number, because the mean of its divisors is an integer number (2083809528).
Almost surely, 213371111061 is an apocalyptic number.
13371111061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13371111061 is a deficient number, since it is larger than the sum of its proper divisors (3299365163).
13371111061 is a wasteful number, since it uses less digits than its factorization.
13371111061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173650811.
The product of its (nonzero) digits is 378, while the sum is 25.
Adding to 13371111061 its reverse (16011117331), we get a palindrome (29382228392).
The spelling of 13371111061 in words is "thirteen billion, three hundred seventy-one million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •