Base | Representation |
---|---|
bin | 1011111010011011000… |
… | …01010100001001110010 |
3 | 1110010112101110000111102 |
4 | 11331031201110021302 |
5 | 23201243023101200 |
6 | 512012401044402 |
7 | 41400251414552 |
oct | 5751541241162 |
9 | 1403471400442 |
10 | 409322472050 |
11 | 148657956658 |
12 | 673b5326702 |
13 | 2c7a2b56aab |
14 | 15b5035b162 |
15 | a9aa0726d5 |
hex | 5f4d854272 |
409322472050 has 54 divisors (see below), whose sum is σ = 767233023687. Its totient is φ = 162471330720.
The previous prime is 409322472047. The next prime is 409322472061. The reversal of 409322472050 is 50274223904.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 332777843161 + 76544628889 = 576869^2 + 276667^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=452395.
It is a super-2 number, since 2×4093224720502 (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 = 409322471995 and 409322472013.
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 26 ways as a sum of consecutive naturals, for example, 782643089 + ... + 782643611.
Almost surely, 2409322472050 is an apocalyptic number.
409322472050 is a deficient number, since it is larger than the sum of its proper divisors (357910551637).
409322472050 is an frugal number, since it uses more digits than its factorization.
409322472050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404 (or 703 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 38.
Adding to 409322472050 its reverse (50274223904), we get a palindrome (459596695954).
The spelling of 409322472050 in words is "four hundred nine billion, three hundred twenty-two million, four hundred seventy-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •