Base | Representation |
---|---|
bin | 1101011101101111010… |
… | …0011011010001110101 |
3 | 211010002011200112021111 |
4 | 3113123310123101311 |
5 | 12242221213021323 |
6 | 254133440315021 |
7 | 22466232633556 |
oct | 3273364332165 |
9 | 733064615244 |
10 | 231321220213 |
11 | 8a114886566 |
12 | 389b9012a71 |
13 | 18a7633bb85 |
14 | b2a5bb232d |
15 | 603d080c0d |
hex | 35dbd1b475 |
231321220213 has 4 divisors (see below), whose sum is σ = 231361226208. Its totient is φ = 231281214220.
The previous prime is 231321220201. The next prime is 231321220219. The reversal of 231321220213 is 312022123132.
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 231321220213 - 25 = 231321220181 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 (231321220219) 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 3 ways as a sum of consecutive naturals, for example, 19994323 + ... + 20005888.
It is an arithmetic number, because the mean of its divisors is an integer number (57840306552).
Almost surely, 2231321220213 is an apocalyptic number.
It is an amenable number.
231321220213 is a deficient number, since it is larger than the sum of its proper divisors (40005995).
231321220213 is an equidigital number, since it uses as much as digits as its factorization.
231321220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40005994.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 231321220213 its reverse (312022123132), we get a palindrome (543343343345).
The spelling of 231321220213 in words is "two hundred thirty-one billion, three hundred twenty-one million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •