Base | Representation |
---|---|
bin | 1101100000101110001… |
… | …1100011100110011111 |
3 | 211012010222200122121020 |
4 | 3120023203203212133 |
5 | 12300341224313343 |
6 | 254345130135223 |
7 | 22525126221432 |
oct | 3301343434637 |
9 | 735128618536 |
10 | 232122104223 |
11 | 8a495970579 |
12 | 38ba1281513 |
13 | 18b73241239 |
14 | b3402cb819 |
15 | 608852eb83 |
hex | 360b8e399f |
232122104223 has 8 divisors (see below), whose sum is σ = 322952492928. Its totient is φ = 148019892504.
The previous prime is 232122104219. The next prime is 232122104243. The reversal of 232122104223 is 322401221232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 232122104223 - 22 = 232122104219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232122104193 and 232122104202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232122104213) 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, 1682044165 + ... + 1682044302.
It is an arithmetic number, because the mean of its divisors is an integer number (40369061616).
Almost surely, 2232122104223 is an apocalyptic number.
232122104223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
232122104223 is a deficient number, since it is larger than the sum of its proper divisors (90830388705).
232122104223 is a wasteful number, since it uses less digits than its factorization.
232122104223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3364088493.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 232122104223 its reverse (322401221232), we get a palindrome (554523325455).
The spelling of 232122104223 in words is "two hundred thirty-two billion, one hundred twenty-two million, one hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •