Base | Representation |
---|---|
bin | 1101100000101001110… |
… | …0001110011111011011 |
3 | 211012002200111122211002 |
4 | 3120022130032133123 |
5 | 12300321432434111 |
6 | 254343221255215 |
7 | 22524511252334 |
oct | 3301234163733 |
9 | 735080448732 |
10 | 232103405531 |
11 | 8a486359a08 |
12 | 38b96b6450b |
13 | 18b6c3c521a |
14 | b33ba2128b |
15 | 6086a8963b |
hex | 360a70e7db |
232103405531 has 8 divisors (see below), whose sum is σ = 237508330224. Its totient is φ = 226698806880.
The previous prime is 232103405507. The next prime is 232103405533. The reversal of 232103405531 is 135504301232.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232103405531 is a prime.
It is a super-2 number, since 2×2321034055312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232103405494 and 232103405503.
It is not an unprimeable number, because it can be changed into a prime (232103405533) 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, 1929821 + ... + 2046561.
It is an arithmetic number, because the mean of its divisors is an integer number (29688541278).
Almost surely, 2232103405531 is an apocalyptic number.
232103405531 is a deficient number, since it is larger than the sum of its proper divisors (5404924693).
232103405531 is a wasteful number, since it uses less digits than its factorization.
232103405531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163021.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 232103405531 its reverse (135504301232), we get a palindrome (367607706763).
The spelling of 232103405531 in words is "two hundred thirty-two billion, one hundred three million, four hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •