Base | Representation |
---|---|
bin | 11110000001001011… |
… | …010111100110110101 |
3 | 10002012022012212112010 |
4 | 132001023113212311 |
5 | 1012002343342323 |
6 | 22450203514433 |
7 | 2220511404042 |
oct | 360113274665 |
9 | 102168185463 |
10 | 32232012213 |
11 | 12740148925 |
12 | 62b6528a19 |
13 | 306892459b |
14 | 17baa5a1c9 |
15 | c89a6ac93 |
hex | 7812d79b5 |
32232012213 has 32 divisors (see below), whose sum is σ = 45506396160. Its totient is φ = 20263248320.
The previous prime is 32232012193. The next prime is 32232012227. The reversal of 32232012213 is 31221023223.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 32232012213 - 229 = 31695141301 is a prime.
It is a super-2 number, since 2×322320122132 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32232012213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32232012233) 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 31 ways as a sum of consecutive naturals, for example, 636556 + ... + 685322.
It is an arithmetic number, because the mean of its divisors is an integer number (1422074880).
Almost surely, 232232012213 is an apocalyptic number.
It is an amenable number.
32232012213 is a deficient number, since it is larger than the sum of its proper divisors (13274383947).
32232012213 is a wasteful number, since it uses less digits than its factorization.
32232012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48977.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 32232012213 its reverse (31221023223), we get a palindrome (63453035436).
The spelling of 32232012213 in words is "thirty-two billion, two hundred thirty-two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •