Base | Representation |
---|---|
bin | 1011001100000101101101… |
… | …1111000111101011100011 |
3 | 1121120002102220210100012122 |
4 | 2303001123133013223203 |
5 | 3103030123213022243 |
6 | 42055335223014455 |
7 | 2406545663000141 |
oct | 263013337075343 |
9 | 47502386710178 |
10 | 12302321220323 |
11 | 3a13426676302 |
12 | 146833259a42b |
13 | 6b31473b3334 |
14 | 307615114591 |
15 | 165029293668 |
hex | b305b7c7ae3 |
12302321220323 has 8 divisors (see below), whose sum is σ = 12317728008960. Its totient is φ = 12286914927040.
The previous prime is 12302321220307. The next prime is 12302321220341. The reversal of 12302321220323 is 32302212320321.
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 12302321220323 - 24 = 12302321220307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12302321220292 and 12302321220301.
It is not an unprimeable number, because it can be changed into a prime (12302321820323) 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, 95427518 + ... + 95556348.
It is an arithmetic number, because the mean of its divisors is an integer number (1539716001120).
Almost surely, 212302321220323 is an apocalyptic number.
12302321220323 is a deficient number, since it is larger than the sum of its proper divisors (15406788637).
12302321220323 is a wasteful number, since it uses less digits than its factorization.
12302321220323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247677.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 12302321220323 its reverse (32302212320321), we get a palindrome (44604533540644).
The spelling of 12302321220323 in words is "twelve trillion, three hundred two billion, three hundred twenty-one million, two hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •