Base | Representation |
---|---|
bin | 1100010011000000011… |
… | …11010001110110101011 |
3 | 1111101121020120200200112 |
4 | 12021200033101312223 |
5 | 23410310440204120 |
6 | 522034220124535 |
7 | 42345321516221 |
oct | 6114017216653 |
9 | 1441536520615 |
10 | 422521413035 |
11 | 153210360347 |
12 | 69a7969674b |
13 | 30ac7501a47 |
14 | 166432b0b11 |
15 | aecdbbebc5 |
hex | 62603d1dab |
422521413035 has 4 divisors (see below), whose sum is σ = 507025695648. Its totient is φ = 338017130424.
The previous prime is 422521413029. The next prime is 422521413047. The reversal of 422521413035 is 530314125224.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 422521413035 - 28 = 422521412779 is a prime.
It is a super-2 number, since 2×4225214130352 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 422521412992 and 422521413010.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 42252141299 + ... + 42252141308.
It is an arithmetic number, because the mean of its divisors is an integer number (126756423912).
Almost surely, 2422521413035 is an apocalyptic number.
422521413035 is a deficient number, since it is larger than the sum of its proper divisors (84504282613).
422521413035 is an equidigital number, since it uses as much as digits as its factorization.
422521413035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84504282612.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 422521413035 its reverse (530314125224), we get a palindrome (952835538259).
The spelling of 422521413035 in words is "four hundred twenty-two billion, five hundred twenty-one million, four hundred thirteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •