Base | Representation |
---|---|
bin | 1110100111001100100111… |
… | …10100011010000001100011 |
3 | 11012202220020002202002211222 |
4 | 13103212103310122001203 |
5 | 13202432122331031321 |
6 | 152201431205125255 |
7 | 6524353632131621 |
oct | 723462364320143 |
9 | 135686202662758 |
10 | 32133130330211 |
11 | a2696473a9429 |
12 | 372b7483b982b |
13 | 14c11ab262531 |
14 | 7d1374d56511 |
15 | 3aacca8553ab |
hex | 1d3993d1a063 |
32133130330211 has 4 divisors (see below), whose sum is σ = 32330266099272. Its totient is φ = 31935994561152.
The previous prime is 32133130330193. The next prime is 32133130330283. The reversal of 32133130330211 is 11203303133123.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32133130330211 is a prime.
It is a super-3 number, since 3×321331303302113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32133130330811) 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, 98567884286 + ... + 98567884611.
It is an arithmetic number, because the mean of its divisors is an integer number (8082566524818).
Almost surely, 232133130330211 is an apocalyptic number.
32133130330211 is a deficient number, since it is larger than the sum of its proper divisors (197135769061).
32133130330211 is a wasteful number, since it uses less digits than its factorization.
32133130330211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197135769060.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 32133130330211 its reverse (11203303133123), we get a palindrome (43336433463334).
The spelling of 32133130330211 in words is "thirty-two trillion, one hundred thirty-three billion, one hundred thirty million, three hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •