Base | Representation |
---|---|
bin | 101101001100000011000… |
… | …110111100001111000111 |
3 | 101222212100122012200222111 |
4 | 231030003012330033013 |
5 | 401334140224144442 |
6 | 10334321125241451 |
7 | 440231364201331 |
oct | 55140306741707 |
9 | 11885318180874 |
10 | 3105313506247 |
11 | a97a57578757 |
12 | 4219b7263287 |
13 | 196aa3117784 |
14 | aa425906451 |
15 | 55b9a1b0b17 |
hex | 2d3031bc3c7 |
3105313506247 has 2 divisors, whose sum is σ = 3105313506248. Its totient is φ = 3105313506246.
The previous prime is 3105313506133. The next prime is 3105313506287. The reversal of 3105313506247 is 7426053135013.
3105313506247 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (3105313506287) can be obtained adding 3105313506247 to its sum of digits (40).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3105313506247 - 223 = 3105305117639 is a prime.
It is a super-3 number, since 3×31053135062473 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3105313506287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552656753123 + 1552656753124.
It is an arithmetic number, because the mean of its divisors is an integer number (1552656753124).
Almost surely, 23105313506247 is an apocalyptic number.
3105313506247 is a deficient number, since it is larger than the sum of its proper divisors (1).
3105313506247 is an equidigital number, since it uses as much as digits as its factorization.
3105313506247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 226800, while the sum is 40.
The spelling of 3105313506247 in words is "three trillion, one hundred five billion, three hundred thirteen million, five hundred six thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •