Base | Representation |
---|---|
bin | 1100001101111111001100… |
… | …0011001101101001110000 |
3 | 1202120022122020211112210011 |
4 | 3003133303003031221300 |
5 | 3230102213223043212 |
6 | 44323410254544304 |
7 | 2554414646410624 |
oct | 303376303155160 |
9 | 52508566745704 |
10 | 13434440440432 |
11 | 430a572436800 |
12 | 160b826b08094 |
13 | 765b2961099b |
14 | 346332277184 |
15 | 1846d99304a7 |
hex | c37f30cda70 |
13434440440432 has 120 divisors (see below), whose sum is σ = 29028128080896. Its totient is φ = 6017542608000.
The previous prime is 13434440440427. The next prime is 13434440440441. The reversal of 13434440440432 is 23404404443431.
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 23 ways as a sum of consecutive naturals, for example, 286847257 + ... + 286894087.
Almost surely, 213434440440432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13434440440432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14514064040448).
13434440440432 is an abundant number, since it is smaller than the sum of its proper divisors (15593687640464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13434440440432 is a wasteful number, since it uses less digits than its factorization.
13434440440432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49019 (or 49002 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 40.
Adding to 13434440440432 its reverse (23404404443431), we get a palindrome (36838844883863).
The spelling of 13434440440432 in words is "thirteen trillion, four hundred thirty-four billion, four hundred forty million, four hundred forty thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •