Base | Representation |
---|---|
bin | 101101001000001001110… |
… | …100010101101100010101 |
3 | 101222110120011021121022102 |
4 | 231020021310111230111 |
5 | 401302104030243442 |
6 | 10332350122011445 |
7 | 440022630310004 |
oct | 55101164255425 |
9 | 11873504247272 |
10 | 3101131102997 |
11 | a96200730244 |
12 | 42102a646b85 |
13 | 196587790355 |
14 | aa14a270c3b |
15 | 55a02e0a232 |
hex | 2d209d15b15 |
3101131102997 has 2 divisors, whose sum is σ = 3101131102998. Its totient is φ = 3101131102996.
The previous prime is 3101131102973. The next prime is 3101131103039. The reversal of 3101131102997 is 7992011311013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2921224487281 + 179906615716 = 1709159^2 + 424154^2 .
It is a cyclic number.
It is not a de Polignac number, because 3101131102997 - 236 = 3032411626261 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3101131102997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3101131102397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550565551498 + 1550565551499.
It is an arithmetic number, because the mean of its divisors is an integer number (1550565551499).
Almost surely, 23101131102997 is an apocalyptic number.
It is an amenable number.
3101131102997 is a deficient number, since it is larger than the sum of its proper divisors (1).
3101131102997 is an equidigital number, since it uses as much as digits as its factorization.
3101131102997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 38.
The spelling of 3101131102997 in words is "three trillion, one hundred one billion, one hundred thirty-one million, one hundred two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •