Base | Representation |
---|---|
bin | 11110000000100110… |
… | …000011010111111101 |
3 | 10002011121210212212102 |
4 | 132000212003113331 |
5 | 1011442342330023 |
6 | 22445214114445 |
7 | 2220332302361 |
oct | 360046032775 |
9 | 102147725772 |
10 | 32222230013 |
11 | 12735677366 |
12 | 62b31aba25 |
13 | 30668aabbc |
14 | 17b96312a1 |
15 | c88c87628 |
hex | 7809835fd |
32222230013 has 4 divisors (see below), whose sum is σ = 32223367260. Its totient is φ = 32221092768.
The previous prime is 32222229971. The next prime is 32222230031. The reversal of 32222230013 is 31003222223.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31003222223 = 1907 ⋅16257589.
It can be written as a sum of positive squares in 2 ways, for example, as 27650036089 + 4572193924 = 166283^2 + 67618^2 .
It is a cyclic number.
It is not a de Polignac number, because 32222230013 - 28 = 32222229757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32222233013) 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, 525008 + ... + 583161.
It is an arithmetic number, because the mean of its divisors is an integer number (8055841815).
Almost surely, 232222230013 is an apocalyptic number.
It is an amenable number.
32222230013 is a deficient number, since it is larger than the sum of its proper divisors (1137247).
32222230013 is a wasteful number, since it uses less digits than its factorization.
32222230013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1137246.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 32222230013 its reverse (31003222223), we get a palindrome (63225452236).
The spelling of 32222230013 in words is "thirty-two billion, two hundred twenty-two million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •