Base | Representation |
---|---|
bin | 11000110110101000… |
… | …11001000010001101 |
3 | 1021102220122102110000 |
4 | 30123110121002031 |
5 | 204311331412031 |
6 | 10044011434513 |
7 | 651441413301 |
oct | 143324310215 |
9 | 37386572400 |
10 | 13343232141 |
11 | 57279a7888 |
12 | 2704755a39 |
13 | 1348528545 |
14 | 908193d01 |
15 | 5316503e6 |
hex | 31b51908d |
13343232141 has 40 divisors (see below), whose sum is σ = 20333938680. Its totient is φ = 8716750848.
The previous prime is 13343232103. The next prime is 13343232157. The reversal of 13343232141 is 14123234331.
It is a happy number.
13343232141 is a `hidden beast` number, since 1 + 334 + 3 + 2 + 321 + 4 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 3307400100 + 10035832041 = 57510^2 + 100179^2 .
It is not a de Polignac number, because 13343232141 - 210 = 13343231117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13343232191) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 4845421 + ... + 4848173.
It is an arithmetic number, because the mean of its divisors is an integer number (508348467).
Almost surely, 213343232141 is an apocalyptic number.
It is an amenable number.
13343232141 is a deficient number, since it is larger than the sum of its proper divisors (6990706539).
13343232141 is a wasteful number, since it uses less digits than its factorization.
13343232141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3947 (or 3938 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
Adding to 13343232141 its reverse (14123234331), we get a palindrome (27466466472).
The spelling of 13343232141 in words is "thirteen billion, three hundred forty-three million, two hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •