Base | Representation |
---|---|
bin | 11101110100001001… |
… | …001100110111100011 |
3 | 10001122001202011211010 |
4 | 131310021030313203 |
5 | 1011030403341011 |
6 | 22412352552003 |
7 | 2212214621103 |
oct | 356411146743 |
9 | 101561664733 |
10 | 32013340131 |
11 | 126387722a3 |
12 | 6255252603 |
13 | 3032530416 |
14 | 17999b7203 |
15 | c757741a6 |
hex | 77424cde3 |
32013340131 has 4 divisors (see below), whose sum is σ = 42684453512. Its totient is φ = 21342226752.
The previous prime is 32013340129. The next prime is 32013340231. The reversal of 32013340131 is 13104331023.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 32013340131 - 21 = 32013340129 is a prime.
It is a super-2 number, since 2×320133401312 (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 = 32013340098 and 32013340107.
It is not an unprimeable number, because it can be changed into a prime (32013340231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5335556686 + ... + 5335556691.
It is an arithmetic number, because the mean of its divisors is an integer number (10671113378).
Almost surely, 232013340131 is an apocalyptic number.
32013340131 is a deficient number, since it is larger than the sum of its proper divisors (10671113381).
32013340131 is a wasteful number, since it uses less digits than its factorization.
32013340131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10671113380.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 32013340131 its reverse (13104331023), we get a palindrome (45117671154).
The spelling of 32013340131 in words is "thirty-two billion, thirteen million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •