Base | Representation |
---|---|
bin | 1001001100011111011… |
… | …11001111110111010001 |
3 | 1010012111200122021100202 |
4 | 10212033233033313101 |
5 | 20134023144441431 |
6 | 401050455224545 |
7 | 31553250611252 |
oct | 4461757176721 |
9 | 1105450567322 |
10 | 315944140241 |
11 | 111a9a259904 |
12 | 51295078155 |
13 | 23a41157512 |
14 | 114128d2b29 |
15 | 834231d8cb |
hex | 498fbcfdd1 |
315944140241 has 4 divisors (see below), whose sum is σ = 315952421952. Its totient is φ = 315935858532.
The previous prime is 315944140231. The next prime is 315944140243. The reversal of 315944140241 is 142041449513.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 315944140241 - 214 = 315944123857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 315944140195 and 315944140204.
It is not an unprimeable number, because it can be changed into a prime (315944140243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4083365 + ... + 4160018.
It is an arithmetic number, because the mean of its divisors is an integer number (78988105488).
Almost surely, 2315944140241 is an apocalyptic number.
It is an amenable number.
315944140241 is a deficient number, since it is larger than the sum of its proper divisors (8281711).
315944140241 is an equidigital number, since it uses as much as digits as its factorization.
315944140241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8281710.
The product of its (nonzero) digits is 69120, while the sum is 38.
Adding to 315944140241 its reverse (142041449513), we get a palindrome (457985589754).
The spelling of 315944140241 in words is "three hundred fifteen billion, nine hundred forty-four million, one hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •