Base | Representation |
---|---|
bin | 110000000010011101110110… |
… | …1001100101110011001000101 |
3 | 2001102010112011012220012011011 |
4 | 1200010323231030232121011 |
5 | 420341040333211113023 |
6 | 4054405242433242221 |
7 | 155001222615366415 |
oct | 14004735514563105 |
9 | 2042115135805134 |
10 | 422551452051013 |
11 | 11270207887541a |
12 | 3b485376403371 |
13 | 151a157aa57bcc |
14 | 764b856a8a645 |
15 | 33cb7edb9250d |
hex | 1804eed32e645 |
422551452051013 has 6 divisors (see below), whose sum is σ = 437624631078674. Its totient is φ = 407980712324304.
The previous prime is 422551452050963. The next prime is 422551452051037. The reversal of 422551452051013 is 310150254155224.
It can be written as a sum of positive squares in 3 ways, for example, as 1702351686564 + 420849100364449 = 1304742^2 + 20514607^2 .
It is not a de Polignac number, because 422551452051013 - 29 = 422551452050501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (422551452751013) 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 in 5 ways as a sum of consecutive naturals, for example, 251219649606 + ... + 251219651287.
Almost surely, 2422551452051013 is an apocalyptic number.
It is an amenable number.
422551452051013 is a deficient number, since it is larger than the sum of its proper divisors (15073179027661).
422551452051013 is an equidigital number, since it uses as much as digits as its factorization.
422551452051013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502439300951 (or 502439300922 counting only the distinct ones).
The product of its (nonzero) digits is 240000, while the sum is 40.
The spelling of 422551452051013 in words is "four hundred twenty-two trillion, five hundred fifty-one billion, four hundred fifty-two million, fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •