Base | Representation |
---|---|
bin | 11101110100100011… |
… | …000110101001101101 |
3 | 10001122112112011100001 |
4 | 131310203012221231 |
5 | 1011034123133123 |
6 | 22413154304301 |
7 | 2212326421615 |
oct | 356443065155 |
9 | 101575464301 |
10 | 32020130413 |
11 | 1264158a9a7 |
12 | 6257588091 |
13 | 3033a6a03b |
14 | 179a863a45 |
15 | c761660ad |
hex | 7748c6a6d |
32020130413 has 4 divisors (see below), whose sum is σ = 32159956540. Its totient is φ = 31880304288.
The previous prime is 32020130357. The next prime is 32020130449. The reversal of 32020130413 is 31403102023.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 16305502249 + 15714628164 = 127693^2 + 125358^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32020130413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32020130713) 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, 69912720 + ... + 69913177.
It is an arithmetic number, because the mean of its divisors is an integer number (8039989135).
Almost surely, 232020130413 is an apocalyptic number.
It is an amenable number.
32020130413 is a deficient number, since it is larger than the sum of its proper divisors (139826127).
32020130413 is a wasteful number, since it uses less digits than its factorization.
32020130413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139826126.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 32020130413 its reverse (31403102023), we get a palindrome (63423232436).
The spelling of 32020130413 in words is "thirty-two billion, twenty million, one hundred thirty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •