Base | Representation |
---|---|
bin | 1001000111111111101… |
… | …10111101010011000001 |
3 | 1002222021110110112211010 |
4 | 10203333312331103001 |
5 | 20114102220222431 |
6 | 400011145111133 |
7 | 31436400041616 |
oct | 4437766752301 |
9 | 1088243415733 |
10 | 313530242241 |
11 | 110a70714587 |
12 | 509207884a9 |
13 | 237480139c8 |
14 | 1126409650d |
15 | 825044e846 |
hex | 48ffdbd4c1 |
313530242241 has 8 divisors (see below), whose sum is σ = 418066210240. Its totient is φ = 209007217872.
The previous prime is 313530242189. The next prime is 313530242323. The reversal of 313530242241 is 142242035313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313530242241 - 26 = 313530242177 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313530242199 and 313530242208.
It is not an unprimeable number, because it can be changed into a prime (313530442241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3179245 + ... + 3276378.
It is an arithmetic number, because the mean of its divisors is an integer number (52258276280).
Almost surely, 2313530242241 is an apocalyptic number.
It is an amenable number.
313530242241 is a deficient number, since it is larger than the sum of its proper divisors (104535967999).
313530242241 is a wasteful number, since it uses less digits than its factorization.
313530242241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6471815.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 313530242241 its reverse (142242035313), we get a palindrome (455772277554).
The spelling of 313530242241 in words is "three hundred thirteen billion, five hundred thirty million, two hundred forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •