Base | Representation |
---|---|
bin | 1110100111001100100100… |
… | …01000010111111101110111 |
3 | 11012202220011010110022010211 |
4 | 13103212102020113331313 |
5 | 13202432043103311411 |
6 | 152201424314130251 |
7 | 6524353136331235 |
oct | 723462210277567 |
9 | 135686133408124 |
10 | 32133102010231 |
11 | a269632416192 |
12 | 372b73aa20987 |
13 | 14c11a5428151 |
14 | 7d13712a3955 |
15 | 3aacc810e221 |
hex | 1d3992217f77 |
32133102010231 has 4 divisors (see below), whose sum is σ = 32445073874512. Its totient is φ = 31821130145952.
The previous prime is 32133102010201. The next prime is 32133102010309. The reversal of 32133102010231 is 13201020133123.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 32133102010231 - 227 = 32132967792503 is a prime.
It is a super-2 number, since 2×321331020102312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32133102010201) 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, 155985931986 + ... + 155985932191.
It is an arithmetic number, because the mean of its divisors is an integer number (8111268468628).
Almost surely, 232133102010231 is an apocalyptic number.
32133102010231 is a deficient number, since it is larger than the sum of its proper divisors (311971864281).
32133102010231 is a wasteful number, since it uses less digits than its factorization.
32133102010231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311971864280.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 32133102010231 its reverse (13201020133123), we get a palindrome (45334122143354).
The spelling of 32133102010231 in words is "thirty-two trillion, one hundred thirty-three billion, one hundred two million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •