Base | Representation |
---|---|
bin | 111001011011100001… |
… | …1011111111110100111 |
3 | 102210100002120221021221 |
4 | 1302313003133332213 |
5 | 4010040014412411 |
6 | 132353534521211 |
7 | 11624144451163 |
oct | 1626703377647 |
9 | 383302527257 |
10 | 123330232231 |
11 | 48338778968 |
12 | 1ba9b066207 |
13 | b82612329b |
14 | 5d7d751ca3 |
15 | 331c52b071 |
hex | 1cb70dffa7 |
123330232231 has 8 divisors (see below), whose sum is σ = 130666240800. Its totient is φ = 116003255808.
The previous prime is 123330232217. The next prime is 123330232261. The reversal of 123330232231 is 132232033321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123330232231 - 227 = 123196014503 is a prime.
It is a super-2 number, since 2×1233302322312 (a number of 23 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 = 123330232196 and 123330232205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123330232261) 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, 2229906 + ... + 2284543.
It is an arithmetic number, because the mean of its divisors is an integer number (16333280100).
Almost surely, 2123330232231 is an apocalyptic number.
123330232231 is a deficient number, since it is larger than the sum of its proper divisors (7336008569).
123330232231 is a wasteful number, since it uses less digits than its factorization.
123330232231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4516073.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 123330232231 its reverse (132232033321), we get a palindrome (255562265552).
The spelling of 123330232231 in words is "one hundred twenty-three billion, three hundred thirty million, two hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •