Base | Representation |
---|---|
bin | 1010001100010111011110… |
… | …00101000011111100110010 |
3 | 2221100212102101002102021121 |
4 | 11012023233011003330302 |
5 | 10414222212002311200 |
6 | 115401213345412454 |
7 | 4502304215666545 |
oct | 506135705037462 |
9 | 87325371072247 |
10 | 22415150432050 |
11 | 716223706a042 |
12 | 262025863a12a |
13 | c6797cc22c1c |
14 | 576c8309285c |
15 | 28d109888e1a |
hex | 1462ef143f32 |
22415150432050 has 12 divisors (see below), whose sum is σ = 41692179803706. Its totient is φ = 8966060172800.
The previous prime is 22415150431979. The next prime is 22415150432057. The reversal of 22415150432050 is 5023405151422.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 8356857617329 + 14058292814721 = 2890823^2 + 3749439^2 .
It is a junction number, because it is equal to n+sod(n) for n = 22415150431997 and 22415150432015.
It is not an unprimeable number, because it can be changed into a prime (22415150432057) 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, 224151504271 + ... + 224151504370.
Almost surely, 222415150432050 is an apocalyptic number.
22415150432050 is a deficient number, since it is larger than the sum of its proper divisors (19277029371656).
22415150432050 is a wasteful number, since it uses less digits than its factorization.
22415150432050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448303008653 (or 448303008648 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 22415150432050 its reverse (5023405151422), we get a palindrome (27438555583472).
The spelling of 22415150432050 in words is "twenty-two trillion, four hundred fifteen billion, one hundred fifty million, four hundred thirty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •