Base | Representation |
---|---|
bin | 11110110110110101… |
… | …101111011001000011 |
3 | 10011112001021211211112 |
4 | 132312311233121003 |
5 | 1020323332442011 |
6 | 23115404233535 |
7 | 2252023002122 |
oct | 366665573103 |
9 | 104461254745 |
10 | 33132312131 |
11 | 13062365546 |
12 | 6507b3b8ab |
13 | 31802c4629 |
14 | 1864453ab9 |
15 | cddb0658b |
hex | 7b6d6f643 |
33132312131 has 4 divisors (see below), whose sum is σ = 33132687072. Its totient is φ = 33131937192.
The previous prime is 33132312121. The next prime is 33132312133. The reversal of 33132312131 is 13121323133.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 33132312131 - 218 = 33132049987 is a prime.
It is a super-2 number, since 2×331323121312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33132312097 and 33132312106.
It is not an unprimeable number, because it can be changed into a prime (33132312133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26441 + ... + 258773.
It is an arithmetic number, because the mean of its divisors is an integer number (8283171768).
Almost surely, 233132312131 is an apocalyptic number.
33132312131 is a deficient number, since it is larger than the sum of its proper divisors (374941).
33132312131 is a wasteful number, since it uses less digits than its factorization.
33132312131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374940.
The product of its digits is 972, while the sum is 23.
Adding to 33132312131 its reverse (13121323133), we get a palindrome (46253635264).
The spelling of 33132312131 in words is "thirty-three billion, one hundred thirty-two million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •