Base | Representation |
---|---|
bin | 1011001101001011010110… |
… | …0100011001101011000001 |
3 | 1121121212200112120211112211 |
4 | 2303102311210121223001 |
5 | 3103331413140021421 |
6 | 42112110040222121 |
7 | 2411110113414355 |
oct | 263226544315301 |
9 | 47555615524484 |
10 | 12321012423361 |
11 | 3a20348339844 |
12 | 146ba8a16a941 |
13 | 6b4b35892ba5 |
14 | 3084a9669465 |
15 | 1657701829e1 |
hex | b34b5919ac1 |
12321012423361 has 8 divisors (see below), whose sum is σ = 12341952301824. Its totient is φ = 12300078399840.
The previous prime is 12321012423347. The next prime is 12321012423397. The reversal of 12321012423361 is 16332421012321.
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 12321012423361 - 223 = 12321004034753 is a prime.
It is a super-2 number, since 2×123210124233612 (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 (12321012423341) 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, 2758936 + ... + 5679238.
It is an arithmetic number, because the mean of its divisors is an integer number (1542744037728).
Almost surely, 212321012423361 is an apocalyptic number.
It is an amenable number.
12321012423361 is a deficient number, since it is larger than the sum of its proper divisors (20939878463).
12321012423361 is an equidigital number, since it uses as much as digits as its factorization.
12321012423361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2927471.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 12321012423361 its reverse (16332421012321), we get a palindrome (28653433435682).
The spelling of 12321012423361 in words is "twelve trillion, three hundred twenty-one billion, twelve million, four hundred twenty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •