Base | Representation |
---|---|
bin | 11110000101001111… |
… | …001110101111001001 |
3 | 10002101001101210010010 |
4 | 132011033032233021 |
5 | 1012122313231241 |
6 | 22501035542133 |
7 | 2222266413621 |
oct | 360517165711 |
9 | 102331353103 |
10 | 32300133321 |
11 | 12775646265 |
12 | 63152ba949 |
13 | 3079a85b31 |
14 | 17c5b0d881 |
15 | c90a24d16 |
hex | 7853cebc9 |
32300133321 has 4 divisors (see below), whose sum is σ = 43066844432. Its totient is φ = 21533422212.
The previous prime is 32300133319. The next prime is 32300133337. The reversal of 32300133321 is 12333100323.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12333100323 = 3 ⋅4111033441.
It is not a de Polignac number, because 32300133321 - 21 = 32300133319 is a prime.
It is a super-2 number, since 2×323001333212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32300133721) 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, 5383355551 + ... + 5383355556.
It is an arithmetic number, because the mean of its divisors is an integer number (10766711108).
Almost surely, 232300133321 is an apocalyptic number.
It is an amenable number.
32300133321 is a deficient number, since it is larger than the sum of its proper divisors (10766711111).
32300133321 is a wasteful number, since it uses less digits than its factorization.
32300133321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10766711110.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 32300133321 its reverse (12333100323), we get a palindrome (44633233644).
The spelling of 32300133321 in words is "thirty-two billion, three hundred million, one hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •