Base | Representation |
---|---|
bin | 10100100010011001110… |
… | …111001000110010100000 |
3 | 11222220220001120222222022 |
4 | 110202121313020302200 |
5 | 141110401121003211 |
6 | 3000204545401012 |
7 | 203652042341000 |
oct | 24423167106240 |
9 | 4886801528868 |
10 | 1411330641056 |
11 | 4a45a6398656 |
12 | 1a9637939168 |
13 | a311b199ccb |
14 | 4c447388000 |
15 | 26aa2c61bdb |
hex | 14899dc8ca0 |
1411330641056 has 48 divisors (see below), whose sum is σ = 3240299966400. Its totient is φ = 604855984320.
The previous prime is 1411330641053. The next prime is 1411330641067. The reversal of 1411330641056 is 6501460331141.
It is not an unprimeable number, because it can be changed into a prime (1411330641053) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 64280690 + ... + 64302641.
It is an arithmetic number, because the mean of its divisors is an integer number (67506249300).
Almost surely, 21411330641056 is an apocalyptic number.
1411330641056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1411330641056 is an abundant number, since it is smaller than the sum of its proper divisors (1828969325344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1411330641056 is an equidigital number, since it uses as much as digits as its factorization.
1411330641056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128583362 (or 128583340 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 1411330641056 its reverse (6501460331141), we get a palindrome (7912790972197).
The spelling of 1411330641056 in words is "one trillion, four hundred eleven billion, three hundred thirty million, six hundred forty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •