Base | Representation |
---|---|
bin | 11000110101010100… |
… | …00000101000010101 |
3 | 1021102010201222101020 |
4 | 30122222000220111 |
5 | 204301010402013 |
6 | 10042533351353 |
7 | 651245111511 |
oct | 143252005025 |
9 | 37363658336 |
10 | 13332122133 |
11 | 57216a9760 |
12 | 2700a98559 |
13 | 1346138685 |
14 | 906901141 |
15 | 5306a8623 |
hex | 31aa80a15 |
13332122133 has 8 divisors (see below), whose sum is σ = 19392177696. Its totient is φ = 8080074000.
The previous prime is 13332122113. The next prime is 13332122147. The reversal of 13332122133 is 33122123331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13332122133 - 28 = 13332121877 is a prime.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13332122113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202001818 + ... + 202001883.
It is an arithmetic number, because the mean of its divisors is an integer number (2424022212).
Almost surely, 213332122133 is an apocalyptic number.
It is an amenable number.
13332122133 is a deficient number, since it is larger than the sum of its proper divisors (6060055563).
13332122133 is a wasteful number, since it uses less digits than its factorization.
13332122133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404003715.
The product of its digits is 1944, while the sum is 24.
Adding to 13332122133 its reverse (33122123331), we get a palindrome (46454245464).
The spelling of 13332122133 in words is "thirteen billion, three hundred thirty-two million, one hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •