Base | Representation |
---|---|
bin | 10110110010010100… |
… | …00100011111111011 |
3 | 1011120112222111012212 |
4 | 23121022010133323 |
5 | 200023201332311 |
6 | 5341520325335 |
7 | 612102512360 |
oct | 133112043773 |
9 | 34515874185 |
10 | 12233230331 |
11 | 5208381013 |
12 | 2454a7384b |
13 | 11cc58523a |
14 | 8409b0467 |
15 | 4b8e90c8b |
hex | 2d92847fb |
12233230331 has 4 divisors (see below), whose sum is σ = 13980834672. Its totient is φ = 10485625992.
The previous prime is 12233230327. The next prime is 12233230391. The reversal of 12233230331 is 13303233221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12233230331 - 22 = 12233230327 is a prime.
It is a super-2 number, since 2×122332303312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12233230297 and 12233230306.
It is not an unprimeable number, because it can be changed into a prime (12233230301) 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, 873802160 + ... + 873802173.
It is an arithmetic number, because the mean of its divisors is an integer number (3495208668).
Almost surely, 212233230331 is an apocalyptic number.
12233230331 is a deficient number, since it is larger than the sum of its proper divisors (1747604341).
12233230331 is an equidigital number, since it uses as much as digits as its factorization.
12233230331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1747604340.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 12233230331 its reverse (13303233221), we get a palindrome (25536463552).
The spelling of 12233230331 in words is "twelve billion, two hundred thirty-three million, two hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •