Base | Representation |
---|---|
bin | 1110101010000001100111… |
… | …01101101011000110011101 |
3 | 11020010012001011202120002111 |
4 | 13111000303231223012131 |
5 | 13211030124330401341 |
6 | 152314221343354021 |
7 | 6534363635322316 |
oct | 725006355530635 |
9 | 136105034676074 |
10 | 32230302200221 |
11 | a2a6881393614 |
12 | 3746546bb2911 |
13 | 14ca3c5b75c78 |
14 | 7d5d5254d60d |
15 | 3ad5b664a681 |
hex | 1d5033b6b19d |
32230302200221 has 8 divisors (see below), whose sum is σ = 32916344918400. Its totient is φ = 31544271632448.
The previous prime is 32230302200209. The next prime is 32230302200249. The reversal of 32230302200221 is 12200220303223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32230302200221 - 27 = 32230302200093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32230302200192 and 32230302200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32230302200251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2427630 + ... + 8387728.
It is an arithmetic number, because the mean of its divisors is an integer number (4114543114800).
Almost surely, 232230302200221 is an apocalyptic number.
It is an amenable number.
32230302200221 is a deficient number, since it is larger than the sum of its proper divisors (686042718179).
32230302200221 is a wasteful number, since it uses less digits than its factorization.
32230302200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6075203.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 32230302200221 its reverse (12200220303223), we get a palindrome (44430522503444).
The spelling of 32230302200221 in words is "thirty-two trillion, two hundred thirty billion, three hundred two million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •