Base | Representation |
---|---|
bin | 1101011101101101001… |
… | …0000100010011100111 |
3 | 211010001112201221000021 |
4 | 3113123102010103213 |
5 | 12242211411310343 |
6 | 254132515300011 |
7 | 22466063241250 |
oct | 3273322042347 |
9 | 733045657007 |
10 | 231312213223 |
11 | 8a10a794473 |
12 | 389b5baa607 |
13 | 18a745072b0 |
14 | b2a4909b27 |
15 | 603c3a20ed |
hex | 35db4844e7 |
231312213223 has 8 divisors (see below), whose sum is σ = 284691954848. Its totient is φ = 183016256544.
The previous prime is 231312213211. The next prime is 231312213239. The reversal of 231312213223 is 322312213132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231312213223 is a prime.
It is a super-2 number, since 2×2313122132232 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231312213283) 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, 1270946136 + ... + 1270946317.
It is an arithmetic number, because the mean of its divisors is an integer number (35586494356).
Almost surely, 2231312213223 is an apocalyptic number.
231312213223 is a deficient number, since it is larger than the sum of its proper divisors (53379741625).
231312213223 is a wasteful number, since it uses less digits than its factorization.
231312213223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2541892473.
The product of its digits is 2592, while the sum is 25.
Adding to 231312213223 its reverse (322312213132), we get a palindrome (553624426355).
Subtracting 231312213223 from its reverse (322312213132), we obtain a palindrome (90999999909).
The spelling of 231312213223 in words is "two hundred thirty-one billion, three hundred twelve million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •