Base | Representation |
---|---|
bin | 101111111010101000111000… |
… | …0001100010001100100010101 |
3 | 2001021022200020010211121120102 |
4 | 1133311101300030101210111 |
5 | 420220424023404110244 |
6 | 4052223120143543445 |
7 | 154530415412104025 |
oct | 13765216014214425 |
9 | 2037280203747512 |
10 | 421475612956949 |
11 | 112327892738691 |
12 | 3b330969bbab85 |
13 | 15123c976c5ba5 |
14 | 7611758345a85 |
15 | 33ad8343b854e |
hex | 17f5470311915 |
421475612956949 has 2 divisors, whose sum is σ = 421475612956950. Its totient is φ = 421475612956948.
The previous prime is 421475612956943. The next prime is 421475612956973. The reversal of 421475612956949 is 949659216574124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216974373002500 + 204501239954449 = 14730050^2 + 14300393^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421475612956949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421475612956943) 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, 210737806478474 + 210737806478475.
It is an arithmetic number, because the mean of its divisors is an integer number (210737806478475).
Almost surely, 2421475612956949 is an apocalyptic number.
It is an amenable number.
421475612956949 is a deficient number, since it is larger than the sum of its proper divisors (1).
421475612956949 is an equidigital number, since it uses as much as digits as its factorization.
421475612956949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1175731200, while the sum is 74.
The spelling of 421475612956949 in words is "four hundred twenty-one trillion, four hundred seventy-five billion, six hundred twelve million, nine hundred fifty-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •