Base | Representation |
---|---|
bin | 1001000111011111100… |
… | …00011101011001011101 |
3 | 1002221120122011001210201 |
4 | 10203233300131121131 |
5 | 20113024041301021 |
6 | 355524255103501 |
7 | 31426606641460 |
oct | 4435760353135 |
9 | 1087518131721 |
10 | 313260103261 |
11 | 110942186126 |
12 | 50866211b91 |
13 | 2370406c861 |
14 | 1123a2572d7 |
15 | 823688d591 |
hex | 48efc1d65d |
313260103261 has 4 divisors (see below), whose sum is σ = 358011546592. Its totient is φ = 268508659932.
The previous prime is 313260103237. The next prime is 313260103271. The reversal of 313260103261 is 162301062313.
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, and also an emirpimes, since its reverse is a distinct semiprime: 162301062313 = 13 ⋅12484697101.
It is a cyclic number.
It is not a de Polignac number, because 313260103261 - 27 = 313260103133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313260103271) 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, 22375721655 + ... + 22375721668.
It is an arithmetic number, because the mean of its divisors is an integer number (89502886648).
Almost surely, 2313260103261 is an apocalyptic number.
It is an amenable number.
313260103261 is a deficient number, since it is larger than the sum of its proper divisors (44751443331).
313260103261 is an equidigital number, since it uses as much as digits as its factorization.
313260103261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44751443330.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 313260103261 its reverse (162301062313), we get a palindrome (475561165574).
The spelling of 313260103261 in words is "three hundred thirteen billion, two hundred sixty million, one hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •