Base | Representation |
---|---|
bin | 101111111110101101011101… |
… | …0001111101011010011010010 |
3 | 2001100022011121210200012110202 |
4 | 1133331122322033223103102 |
5 | 420304111042441030000 |
6 | 4053332143404055202 |
7 | 154616015466661646 |
oct | 13775327217532322 |
9 | 2040264553605422 |
10 | 422035201111250 |
11 | 11252313a6573a1 |
12 | 3b4012bab34502 |
13 | 15164996b7285c |
14 | 7630881452c26 |
15 | 33bd1864eadd5 |
hex | 17fd6ba3eb4d2 |
422035201111250 has 40 divisors (see below), whose sum is σ = 791238857101308. Its totient is φ = 168776505512000.
The previous prime is 422035201111229. The next prime is 422035201111259. The reversal of 422035201111250 is 52111102530224.
It can be written as a sum of positive squares in 10 ways, for example, as 10033176615361 + 412002024495889 = 3167519^2 + 20297833^2 .
It is a super-2 number, since 2×4220352011112502 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (422035201111259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 31956437 + ... + 43188936.
Almost surely, 2422035201111250 is an apocalyptic number.
422035201111250 is a deficient number, since it is larger than the sum of its proper divisors (369203655990058).
422035201111250 is an equidigital number, since it uses as much as digits as its factorization.
422035201111250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75149888 (or 75149873 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 422035201111250 its reverse (52111102530224), we get a palindrome (474146303641474).
The spelling of 422035201111250 in words is "four hundred twenty-two trillion, thirty-five billion, two hundred one million, one hundred eleven thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •