Base | Representation |
---|---|
bin | 110100100001100010100110… |
… | …011010111010111110001101 |
3 | 1010021220200221001222100011201 |
4 | 310201202212122322332031 |
5 | 220234224241124420323 |
6 | 2135145242414545501 |
7 | 66441303305603311 |
oct | 6441424632727615 |
9 | 1107820831870151 |
10 | 231003313123213 |
11 | 67671a56017854 |
12 | 21aa9ba6208291 |
13 | 9bb86991c22a7 |
14 | 410889744bb41 |
15 | 1ba8dd63c58ad |
hex | d218a66baf8d |
231003313123213 has 8 divisors (see below), whose sum is σ = 231513298329600. Its totient is φ = 230493742374480.
The previous prime is 231003313123129. The next prime is 231003313123279. The reversal of 231003313123213 is 312321313300132.
It is a happy number.
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 231003313123213 - 225 = 231003279568781 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 (231003313123013) 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, 102498445 + ... + 104727922.
It is an arithmetic number, because the mean of its divisors is an integer number (28939162291200).
Almost surely, 2231003313123213 is an apocalyptic number.
It is an amenable number.
231003313123213 is a deficient number, since it is larger than the sum of its proper divisors (509985206387).
231003313123213 is a wasteful number, since it uses less digits than its factorization.
231003313123213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207228827.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 231003313123213 its reverse (312321313300132), we get a palindrome (543324626423345).
The spelling of 231003313123213 in words is "two hundred thirty-one trillion, three billion, three hundred thirteen million, one hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •