Base | Representation |
---|---|
bin | 1110101001001001110010… |
… | …01111101011100111000011 |
3 | 11020000022200101012201122011 |
4 | 13110210321033223213003 |
5 | 13210032234014331321 |
6 | 152252343312153351 |
7 | 6532253125635463 |
oct | 724447117534703 |
9 | 136008611181564 |
10 | 32200330230211 |
11 | a2950a0a54970 |
12 | 3740781538857 |
13 | 14c762a546280 |
14 | 7d470bb1dba3 |
15 | 3ac91020bae1 |
hex | 1d49393eb9c3 |
32200330230211 has 8 divisors (see below), whose sum is σ = 37829758592304. Its totient is φ = 27021256137120.
The previous prime is 32200330230203. The next prime is 32200330230247. The reversal of 32200330230211 is 11203203300223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32200330230211 - 23 = 32200330230203 is a prime.
It is a super-2 number, since 2×322003302302112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32200330239211) 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, 112588567096 + ... + 112588567381.
It is an arithmetic number, because the mean of its divisors is an integer number (4728719824038).
Almost surely, 232200330230211 is an apocalyptic number.
32200330230211 is a deficient number, since it is larger than the sum of its proper divisors (5629428362093).
32200330230211 is a wasteful number, since it uses less digits than its factorization.
32200330230211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225177134501.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 32200330230211 its reverse (11203203300223), we get a palindrome (43403533530434).
The spelling of 32200330230211 in words is "thirty-two trillion, two hundred billion, three hundred thirty million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •