Base | Representation |
---|---|
bin | 1100001110011011100001… |
… | …0010101000111111011100 |
3 | 1202121001021012100000111220 |
4 | 3003212320102220333130 |
5 | 3230213301402012140 |
6 | 44331105013413340 |
7 | 2555104252400454 |
oct | 303467022507734 |
9 | 52531235300456 |
10 | 13442044563420 |
11 | 43128147a4970 |
12 | 16111a963a250 |
13 | 76676bb27045 |
14 | 346854130d64 |
15 | 1849d22cdbd0 |
hex | c39b84a8fdc |
13442044563420 has 48 divisors (see below), whose sum is σ = 41059336123008. Its totient is φ = 3258677469760.
The previous prime is 13442044563323. The next prime is 13442044563449. The reversal of 13442044563420 is 2436544024431.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 10183366434 + ... + 10183367753.
It is an arithmetic number, because the mean of its divisors is an integer number (855402835896).
Almost surely, 213442044563420 is an apocalyptic number.
13442044563420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13442044563420 is an abundant number, since it is smaller than the sum of its proper divisors (27617291559588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13442044563420 is a wasteful number, since it uses less digits than its factorization.
13442044563420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20366734210 (or 20366734208 counting only the distinct ones).
The product of its (nonzero) digits is 1105920, while the sum is 42.
Adding to 13442044563420 its reverse (2436544024431), we get a palindrome (15878588587851).
The spelling of 13442044563420 in words is "thirteen trillion, four hundred forty-two billion, forty-four million, five hundred sixty-three thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •