Base | Representation |
---|---|
bin | 1011001101001100100010… |
… | …1011010011011101010110 |
3 | 1121121220111212210211001111 |
4 | 2303103020223103131112 |
5 | 3103333042222000042 |
6 | 42112201531245234 |
7 | 2411121055314244 |
oct | 263231053233526 |
9 | 47556455724044 |
10 | 12321333000022 |
11 | 3a204a2297832 |
12 | 146bb595a981a |
13 | 6b4b87116717 |
14 | 3084da077794 |
15 | 16578d3a8517 |
hex | b34c8ad3756 |
12321333000022 has 8 divisors (see below), whose sum is σ = 18500136892200. Its totient is φ = 6154620702624.
The previous prime is 12321333000017. The next prime is 12321333000061. The reversal of 12321333000022 is 22000033312321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×123213330000222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12321332999957 and 12321333000002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3022896147 + ... + 3022900222.
It is an arithmetic number, because the mean of its divisors is an integer number (2312517111525).
Almost surely, 212321333000022 is an apocalyptic number.
12321333000022 is a deficient number, since it is larger than the sum of its proper divisors (6178803892178).
12321333000022 is a wasteful number, since it uses less digits than its factorization.
12321333000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6045797390.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12321333000022 its reverse (22000033312321), we get a palindrome (34321366312343).
The spelling of 12321333000022 in words is "twelve trillion, three hundred twenty-one billion, three hundred thirty-three million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •