Base | Representation |
---|---|
bin | 1101011101101111001… |
… | …1111110101111010111 |
3 | 211010002011110120221002 |
4 | 3113123303332233113 |
5 | 12242221200301234 |
6 | 254133434013515 |
7 | 22466231636015 |
oct | 3273363765727 |
9 | 733064416832 |
10 | 231321103319 |
11 | 8a114806759 |
12 | 389b8b7729b |
13 | 18a762ca8c7 |
14 | b2a5b818b5 |
15 | 603d05b27e |
hex | 35dbcfebd7 |
231321103319 has 8 divisors (see below), whose sum is σ = 233220565248. Its totient is φ = 229423666680.
The previous prime is 231321103283. The next prime is 231321103331. The reversal of 231321103319 is 913301123132.
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 231321103319 - 220 = 231320054743 is a prime.
It is a super-3 number, since 3×2313211033193 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231321103291 and 231321103300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231321100319) 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, 276527 + ... + 734240.
It is an arithmetic number, because the mean of its divisors is an integer number (29152570656).
Almost surely, 2231321103319 is an apocalyptic number.
231321103319 is a deficient number, since it is larger than the sum of its proper divisors (1899461929).
231321103319 is a wasteful number, since it uses less digits than its factorization.
231321103319 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012645.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 231321103319 in words is "two hundred thirty-one billion, three hundred twenty-one million, one hundred three thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •