Base | Representation |
---|---|
bin | 1001000111011011111… |
… | …10001000011110001101 |
3 | 1002221111112202102111222 |
4 | 10203231332020132031 |
5 | 20112443403230013 |
6 | 355521304453125 |
7 | 31426064126141 |
oct | 4435576103615 |
9 | 1087445672458 |
10 | 313230133133 |
11 | 110927276125 |
12 | 5085817a1a5 |
13 | 236caaa8358 |
14 | 11236295221 |
15 | 8233e1d508 |
hex | 48edf8878d |
313230133133 has 8 divisors (see below), whose sum is σ = 342353998080. Its totient is φ = 285294997440.
The previous prime is 313230133129. The next prime is 313230133259. The reversal of 313230133133 is 331331032313.
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 313230133133 - 22 = 313230133129 is a prime.
It is a super-2 number, since 2×3132301331332 (a number of 24 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 (313230133123) 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, 297181763 + ... + 297182816.
It is an arithmetic number, because the mean of its divisors is an integer number (42794249760).
Almost surely, 2313230133133 is an apocalyptic number.
It is an amenable number.
313230133133 is a deficient number, since it is larger than the sum of its proper divisors (29123864947).
313230133133 is a wasteful number, since it uses less digits than its factorization.
313230133133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594364627.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 313230133133 its reverse (331331032313), we get a palindrome (644561165446).
The spelling of 313230133133 in words is "three hundred thirteen billion, two hundred thirty million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •