Base | Representation |
---|---|
bin | 1001000111001110110… |
… | …00111000001111101001 |
3 | 1002221012211222001021121 |
4 | 10203213120320033221 |
5 | 20112232121012131 |
6 | 355502321535241 |
7 | 31423253366344 |
oct | 4434730701751 |
9 | 1087184861247 |
10 | 313119704041 |
11 | 11087aa01111 |
12 | 508271a4521 |
13 | 236b0c528b1 |
14 | 1122574b45b |
15 | 82293a8911 |
hex | 48e76383e9 |
313119704041 has 3 divisors (see below), whose sum is σ = 313120263613. Its totient is φ = 313119144470.
The previous prime is 313119703943. The next prime is 313119704047. The reversal of 313119704041 is 140407911313.
The square root of 313119704041 is 559571.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 313119704041 - 219 = 313119179753 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313119703988 and 313119704006.
It is not an unprimeable number, because it can be changed into a prime (313119704047) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 279786 + ... + 839356.
Almost surely, 2313119704041 is an apocalyptic number.
313119704041 is the 559571-st square number.
313119704041 is the 279786-th centered octagonal number.
It is an amenable number.
313119704041 is a deficient number, since it is larger than the sum of its proper divisors (559572).
313119704041 is an frugal number, since it uses more digits than its factorization.
313119704041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1119142 (or 559571 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 313119704041 in words is "three hundred thirteen billion, one hundred nineteen million, seven hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •