Base | Representation |
---|---|
bin | 1011001101010100101100… |
… | …0011111101101000110001 |
3 | 1121122010011022222110002011 |
4 | 2303111023003331220301 |
5 | 3103402032222033241 |
6 | 42113202553122521 |
7 | 2411226216632050 |
oct | 263251303755061 |
9 | 47563138873064 |
10 | 12323520502321 |
11 | 3a21415060676 |
12 | 147046a0b9441 |
13 | 6b5145390692 |
14 | 3086667c0397 |
15 | 16586a457281 |
hex | b354b0fda31 |
12323520502321 has 8 divisors (see below), whose sum is σ = 14084058678464. Its totient is φ = 10562991138000.
The previous prime is 12323520502309. The next prime is 12323520502483. The reversal of 12323520502321 is 12320502532321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12323520502321 - 217 = 12323520371249 is a prime.
It is a super-2 number, since 2×123235205023212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12323500502321) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1130071 + ... + 5091571.
It is an arithmetic number, because the mean of its divisors is an integer number (1760507334808).
Almost surely, 212323520502321 is an apocalyptic number.
It is an amenable number.
12323520502321 is a deficient number, since it is larger than the sum of its proper divisors (1760538176143).
12323520502321 is an equidigital number, since it uses as much as digits as its factorization.
12323520502321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4405911.
The product of its (nonzero) digits is 21600, while the sum is 31.
The spelling of 12323520502321 in words is "twelve trillion, three hundred twenty-three billion, five hundred twenty million, five hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •