Base | Representation |
---|---|
bin | 1011001101001000000010… |
… | …0100110000001010000101 |
3 | 1121121210101120120212011022 |
4 | 2303102000210300022011 |
5 | 3103323103032314023 |
6 | 42111441515520525 |
7 | 2411046066243152 |
oct | 263220044601205 |
9 | 47553346525138 |
10 | 12320123323013 |
11 | 3a1aa31481570 |
12 | 146b880459145 |
13 | 6b4a236146cc |
14 | 308423549229 |
15 | 16571c0aa7c8 |
hex | b3480930285 |
12320123323013 has 4 divisors (see below), whose sum is σ = 13440134534208. Its totient is φ = 11200112111820.
The previous prime is 12320123322971. The next prime is 12320123323121. The reversal of 12320123323013 is 31032332102321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12320123323013 - 220 = 12320122274437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12320123323913) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560005605581 + ... + 560005605602.
It is an arithmetic number, because the mean of its divisors is an integer number (3360033633552).
Almost surely, 212320123323013 is an apocalyptic number.
It is an amenable number.
12320123323013 is a deficient number, since it is larger than the sum of its proper divisors (1120011211195).
12320123323013 is a wasteful number, since it uses less digits than its factorization.
12320123323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120011211194.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 12320123323013 its reverse (31032332102321), we get a palindrome (43352455425334).
The spelling of 12320123323013 in words is "twelve trillion, three hundred twenty billion, one hundred twenty-three million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •