Base | Representation |
---|---|
bin | 101101011001110101110… |
… | …111000000110010011101 |
3 | 102001021120210001001011112 |
4 | 231121311313000302131 |
5 | 402110003121043232 |
6 | 10345210501231405 |
7 | 441264400054205 |
oct | 55316567006235 |
9 | 12037523031145 |
10 | 3120123612317 |
11 | aa326748a638 |
12 | 42484b102565 |
13 | 1982c350744a |
14 | ab02c819405 |
15 | 562654b54b2 |
hex | 2d675dc0c9d |
3120123612317 has 2 divisors, whose sum is σ = 3120123612318. Its totient is φ = 3120123612316.
The previous prime is 3120123612311. The next prime is 3120123612373. The reversal of 3120123612317 is 7132163210213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2165309307001 + 954814305316 = 1471499^2 + 977146^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120123612317 - 214 = 3120123595933 is a prime.
It is a super-2 number, since 2×31201236123172 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120123612311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560061806158 + 1560061806159.
It is an arithmetic number, because the mean of its divisors is an integer number (1560061806159).
Almost surely, 23120123612317 is an apocalyptic number.
It is an amenable number.
3120123612317 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120123612317 is an equidigital number, since it uses as much as digits as its factorization.
3120123612317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
The spelling of 3120123612317 in words is "three trillion, one hundred twenty billion, one hundred twenty-three million, six hundred twelve thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •