Base | Representation |
---|---|
bin | 1100001110100100010011… |
… | …0100101100100110010010 |
3 | 1202121021100111211111220012 |
4 | 3003221010310230212102 |
5 | 3230233113442120310 |
6 | 44332135000114522 |
7 | 2555216552005100 |
oct | 303510464544622 |
9 | 52537314744805 |
10 | 13444402301330 |
11 | 43138146712a0 |
12 | 1611747165a42 |
13 | 766a56436630 |
14 | 3469d930cc70 |
15 | 184abe2a7c05 |
hex | c3a44d2c992 |
13444402301330 has 192 divisors, whose sum is σ = 33291472677120. Its totient is φ = 3842500032000.
The previous prime is 13444402301287. The next prime is 13444402301333. The reversal of 13444402301330 is 3310320444431.
It is not an unprimeable number, because it can be changed into a prime (13444402301333) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 9945236 + ... + 11215904.
It is an arithmetic number, because the mean of its divisors is an integer number (173393086860).
Almost surely, 213444402301330 is an apocalyptic number.
13444402301330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13444402301330 is an abundant number, since it is smaller than the sum of its proper divisors (19847070375790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13444402301330 is a wasteful number, since it uses less digits than its factorization.
13444402301330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270865 (or 1270858 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 13444402301330 its reverse (3310320444431), we get a palindrome (16754722745761).
The spelling of 13444402301330 in words is "thirteen trillion, four hundred forty-four billion, four hundred two million, three hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •