Base | Representation |
---|---|
bin | 1100010011000011100… |
… | …01000101011000010010 |
3 | 1111101200000211021210200 |
4 | 12021201301011120102 |
5 | 23410334021131200 |
6 | 522040533440030 |
7 | 42346052452434 |
oct | 6114161053022 |
9 | 1441600737720 |
10 | 422547052050 |
11 | 153223882312 |
12 | 69a861a0016 |
13 | 30acc90aa66 |
14 | 16646866654 |
15 | aed1086800 |
hex | 6261c45612 |
422547052050 has 54 divisors (see below), whose sum is σ = 1135280128437. Its totient is φ = 112675536720.
The previous prime is 422547052021. The next prime is 422547052061. The reversal of 422547052050 is 50250745224.
422547052050 is a `hidden beast` number, since 42 + 2 + 5 + 47 + 0 + 520 + 50 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 414096111009 + 8450941041 = 643503^2 + 91929^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=459645.
It is a super-2 number, since 2×4225470520502 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 422547051996 and 422547052014.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 13774029 + ... + 13804671.
Almost surely, 2422547052050 is an apocalyptic number.
422547052050 is an abundant number, since it is smaller than the sum of its proper divisors (712733076387).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
422547052050 is an frugal number, since it uses more digits than its factorization.
422547052050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61304 (or 30653 counting only the distinct ones).
The product of its (nonzero) digits is 112000, while the sum is 36.
Adding to 422547052050 its reverse (50250745224), we get a palindrome (472797797274).
The spelling of 422547052050 in words is "four hundred twenty-two billion, five hundred forty-seven million, fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •