Base | Representation |
---|---|
bin | 10010101001100010100… |
… | …001100101000101110010 |
3 | 11112111220122111010211002 |
4 | 102221202201211011302 |
5 | 131444110111132200 |
6 | 2420423141122002 |
7 | 161406040445441 |
oct | 22514241450562 |
9 | 4474818433732 |
10 | 1281553224050 |
11 | 45455a426410 |
12 | 1884596b9302 |
13 | 93b084587b8 |
14 | 4605569cd58 |
15 | 23509718bd5 |
hex | 12a62865172 |
1281553224050 has 192 divisors, whose sum is σ = 2685792384000. Its totient is φ = 450940089600.
The previous prime is 1281553224047. The next prime is 1281553224089. The reversal of 1281553224050 is 504223551821.
It is a junction number, because it is equal to n+sod(n) for n = 1281553223995 and 1281553224013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1491912521 + ... + 1491913379.
It is an arithmetic number, because the mean of its divisors is an integer number (13988502000).
Almost surely, 21281553224050 is an apocalyptic number.
1281553224050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1281553224050 is an abundant number, since it is smaller than the sum of its proper divisors (1404239159950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1281553224050 is a wasteful number, since it uses less digits than its factorization.
1281553224050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1441 (or 1436 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 1281553224050 its reverse (504223551821), we get a palindrome (1785776775871).
The spelling of 1281553224050 in words is "one trillion, two hundred eighty-one billion, five hundred fifty-three million, two hundred twenty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •