Base | Representation |
---|---|
bin | 10010101010011… |
… | …001011010100001 |
3 | 210211011022222200 |
4 | 102222121122201 |
5 | 1120123312113 |
6 | 51022523413 |
7 | 10521224514 |
oct | 2252313241 |
9 | 724138880 |
10 | 313104033 |
11 | 150814770 |
12 | 88a36569 |
13 | 4cb38478 |
14 | 2d824d7b |
15 | 1c74b873 |
hex | 12a996a1 |
313104033 has 48 divisors (see below), whose sum is σ = 506425920. Its totient is φ = 184809600.
The previous prime is 313104031. The next prime is 313104041. The reversal of 313104033 is 330401313.
It is not a de Polignac number, because 313104033 - 21 = 313104031 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 313103997 and 313104015.
It is not an unprimeable number, because it can be changed into a prime (313104031) 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 47 ways as a sum of consecutive naturals, for example, 839235 + ... + 839607.
It is an arithmetic number, because the mean of its divisors is an integer number (10550540).
Almost surely, 2313104033 is an apocalyptic number.
313104033 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
313104033 is a deficient number, since it is larger than the sum of its proper divisors (193321887).
313104033 is a wasteful number, since it uses less digits than its factorization.
313104033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590 (or 587 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
The square root of 313104033 is about 17694.7459151015. The cubic root of 313104033 is about 679.0413488296.
Adding to 313104033 its reverse (330401313), we get a palindrome (643505346).
The spelling of 313104033 in words is "three hundred thirteen million, one hundred four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •