Base | Representation |
---|---|
bin | 11101110100001000… |
… | …101111110010010011 |
3 | 10001122001112010102021 |
4 | 131310020233302103 |
5 | 1011030341033021 |
6 | 22412350232311 |
7 | 2212213613602 |
oct | 356410576223 |
9 | 101561463367 |
10 | 32013221011 |
11 | 126386a0852 |
12 | 62551b5697 |
13 | 30324bb135 |
14 | 1799985a39 |
15 | c7574dc41 |
hex | 77422fc93 |
32013221011 has 4 divisors (see below), whose sum is σ = 33698127400. Its totient is φ = 30328314624.
The previous prime is 32013220997. The next prime is 32013221021. The reversal of 32013221011 is 11012231023.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11012231023 = 449 ⋅24526127.
It is a cyclic number.
It is not a de Polignac number, because 32013221011 - 215 = 32013188243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32013221021) 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, 842453166 + ... + 842453203.
It is an arithmetic number, because the mean of its divisors is an integer number (8424531850).
Almost surely, 232013221011 is an apocalyptic number.
32013221011 is a deficient number, since it is larger than the sum of its proper divisors (1684906389).
32013221011 is a wasteful number, since it uses less digits than its factorization.
32013221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1684906388.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 32013221011 its reverse (11012231023), we get a palindrome (43025452034).
It can be divided in two parts, 320132 and 21011, that added together give a palindrome (341143).
The spelling of 32013221011 in words is "thirty-two billion, thirteen million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •