Base | Representation |
---|---|
bin | 110100011011101100111111… |
… | …0100000011111100000110101 |
3 | 2020110222200220200202011211221 |
4 | 1220313121332200133200311 |
5 | 440422332401430012343 |
6 | 4312522155235230341 |
7 | 166100624341325212 |
oct | 15067317640374065 |
9 | 2213880820664757 |
10 | 461204300625973 |
11 | 123a5471114a833 |
12 | 438885971483b1 |
13 | 16a464c0692328 |
14 | 81c659b716b09 |
15 | 384beb02265ed |
hex | 1a3767e81f835 |
461204300625973 has 2 divisors, whose sum is σ = 461204300625974. Its totient is φ = 461204300625972.
The previous prime is 461204300625941. The next prime is 461204300626117. The reversal of 461204300625973 is 379526003402164.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 419424133143409 + 41780167482564 = 20479847^2 + 6463758^2 .
It is a cyclic number.
It is not a de Polignac number, because 461204300625973 - 25 = 461204300625941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 461204300625973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (461204300623973) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 230602150312986 + 230602150312987.
It is an arithmetic number, because the mean of its divisors is an integer number (230602150312987).
Almost surely, 2461204300625973 is an apocalyptic number.
It is an amenable number.
461204300625973 is a deficient number, since it is larger than the sum of its proper divisors (1).
461204300625973 is an equidigital number, since it uses as much as digits as its factorization.
461204300625973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 52.
The spelling of 461204300625973 in words is "four hundred sixty-one trillion, two hundred four billion, three hundred million, six hundred twenty-five thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •