Base | Representation |
---|---|
bin | 10010101110010… |
… | …100100000110101 |
3 | 210220002120211021 |
4 | 102232110200311 |
5 | 1120404220113 |
6 | 51100541141 |
7 | 10533040201 |
oct | 2256244065 |
9 | 726076737 |
10 | 314132533 |
11 | 151357470 |
12 | 892517b1 |
13 | 50108650 |
14 | 2da11b01 |
15 | 1c8a148d |
hex | 12b94835 |
314132533 has 8 divisors (see below), whose sum is σ = 369050976. Its totient is φ = 263607600.
The previous prime is 314132527. The next prime is 314132557. The reversal of 314132533 is 335231413.
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-314132533 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314132498 and 314132507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314132503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1098223 + ... + 1098508.
It is an arithmetic number, because the mean of its divisors is an integer number (46131372).
Almost surely, 2314132533 is an apocalyptic number.
It is an amenable number.
314132533 is a deficient number, since it is larger than the sum of its proper divisors (54918443).
314132533 is a wasteful number, since it uses less digits than its factorization.
314132533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2196755.
The product of its digits is 3240, while the sum is 25.
The square root of 314132533 is about 17723.7843870884. The cubic root of 314132533 is about 679.7840526804.
Adding to 314132533 its reverse (335231413), we get a palindrome (649363946).
The spelling of 314132533 in words is "three hundred fourteen million, one hundred thirty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •