Base | Representation |
---|---|
bin | 10110111100110100… |
… | …00111100101000010 |
3 | 1011210200202002002112 |
4 | 23132122013211002 |
5 | 200213224321310 |
6 | 5354344415322 |
7 | 614222343311 |
oct | 133632074502 |
9 | 34720662075 |
10 | 12321323330 |
11 | 525307a648 |
12 | 247a477542 |
13 | 12148ba184 |
14 | 84c582278 |
15 | 4c1a92705 |
hex | 2de687942 |
12321323330 has 32 divisors (see below), whose sum is σ = 23192417664. Its totient is φ = 4704109696.
The previous prime is 12321323309. The next prime is 12321323387. The reversal of 12321323330 is 3332312321.
12321323330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12321323296 and 12321323305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50054 + ... + 164766.
It is an arithmetic number, because the mean of its divisors is an integer number (724763052).
Almost surely, 212321323330 is an apocalyptic number.
12321323330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12321323330 is a deficient number, since it is larger than the sum of its proper divisors (10871094334).
12321323330 is a wasteful number, since it uses less digits than its factorization.
12321323330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115210.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 12321323330 its reverse (3332312321), we get a palindrome (15653635651).
The spelling of 12321323330 in words is "twelve billion, three hundred twenty-one million, three hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •