Base | Representation |
---|---|
bin | 1101100000101001011… |
… | …0110111011011000010 |
3 | 211012002120212021020022 |
4 | 3120022112313123002 |
5 | 12300321103002242 |
6 | 254343131213442 |
7 | 22524463310453 |
oct | 3301226673302 |
9 | 735076767208 |
10 | 232102000322 |
11 | 8a48558a185 |
12 | 38b965a7282 |
13 | 18b6c02273a |
14 | b33b77712a |
15 | 60868ad0d2 |
hex | 360a5b76c2 |
232102000322 has 8 divisors (see below), whose sum is σ = 348159411216. Its totient is φ = 116048863252.
The previous prime is 232102000303. The next prime is 232102000327. The reversal of 232102000322 is 223000201232.
232102000322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 232102000322.
It is not an unprimeable number, because it can be changed into a prime (232102000327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 929048 + ... + 1152099.
It is an arithmetic number, because the mean of its divisors is an integer number (43519926402).
Almost surely, 2232102000322 is an apocalyptic number.
232102000322 is a deficient number, since it is larger than the sum of its proper divisors (116057410894).
232102000322 is a wasteful number, since it uses less digits than its factorization.
232102000322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2136912.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 232102000322 its reverse (223000201232), we get a palindrome (455102201554).
The spelling of 232102000322 in words is "two hundred thirty-two billion, one hundred two million, three hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •