Base | Representation |
---|---|
bin | 1011001101001011011000… |
… | …0010000110110000110111 |
3 | 1121121212201002020110010102 |
4 | 2303102312002012300313 |
5 | 3103331422133211411 |
6 | 42112110515144315 |
7 | 2411110236535535 |
oct | 263226602066067 |
9 | 47555632213112 |
10 | 12321020210231 |
11 | 3a20351778177 |
12 | 146ba908a509b |
13 | 6b4b3738b2c5 |
14 | 3084aa6d5155 |
15 | 165770bbed3b |
hex | b34b6086c37 |
12321020210231 has 4 divisors (see below), whose sum is σ = 12325674923952. Its totient is φ = 12316365496512.
The previous prime is 12321020210179. The next prime is 12321020210273. The reversal of 12321020210231 is 13201202012321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12321020210231 - 26 = 12321020210167 is a prime.
It is a super-2 number, since 2×123210202102312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12321020219231) 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, 2327352890 + ... + 2327358183.
It is an arithmetic number, because the mean of its divisors is an integer number (3081418730988).
Almost surely, 212321020210231 is an apocalyptic number.
12321020210231 is a deficient number, since it is larger than the sum of its proper divisors (4654713721).
12321020210231 is an equidigital number, since it uses as much as digits as its factorization.
12321020210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4654713720.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12321020210231 its reverse (13201202012321), we get a palindrome (25522222222552).
The spelling of 12321020210231 in words is "twelve trillion, three hundred twenty-one billion, twenty million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •