Base | Representation |
---|---|
bin | 1100001101010101000111… |
… | …0000001111010111000000 |
3 | 1202112020111000100020212011 |
4 | 3003111101300033113000 |
5 | 3224411044431302240 |
6 | 44314301333342304 |
7 | 2553535013560234 |
oct | 303252160172700 |
9 | 52466430306764 |
10 | 13423144400320 |
11 | 43057a6089666 |
12 | 16095b3a97994 |
13 | 764a49273a95 |
14 | 34597dd445c4 |
15 | 184277db56ea |
hex | c3551c0f5c0 |
13423144400320 has 28 divisors (see below), whose sum is σ = 31963862604024. Its totient is φ = 5369257760000.
The previous prime is 13423144400317. The next prime is 13423144400357. The reversal of 13423144400320 is 2300444132431.
It is a super-2 number, since 2×134231444003202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 20973662806 + ... + 20973663445.
Almost surely, 213423144400320 is an apocalyptic number.
13423144400320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13423144400320 is an abundant number, since it is smaller than the sum of its proper divisors (18540718203704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13423144400320 is an equidigital number, since it uses as much as digits as its factorization.
13423144400320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41947326268 (or 41947326258 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 13423144400320 its reverse (2300444132431), we get a palindrome (15723588532751).
The spelling of 13423144400320 in words is "thirteen trillion, four hundred twenty-three billion, one hundred forty-four million, four hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •