Base | Representation |
---|---|
bin | 1011110100111001100110… |
… | …0111011011011111010100 |
3 | 1201001010011022121000111210 |
4 | 2331032121213123133110 |
5 | 3201022022433132002 |
6 | 43353411021301420 |
7 | 2511316305652422 |
oct | 275163147333724 |
9 | 51033138530453 |
10 | 13003443255252 |
11 | 416380279a39a |
12 | 15601a2a04870 |
13 | 7342b1147668 |
14 | 32d527452112 |
15 | 1783b1ad596c |
hex | bd3999db7d4 |
13003443255252 has 24 divisors (see below), whose sum is σ = 30342821798016. Its totient is φ = 4334273341888.
The previous prime is 13003443255239. The next prime is 13003443255287. The reversal of 13003443255252 is 25255234430031.
It is a self number, because there is not a number n which added to its sum of digits gives 13003443255252.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25706988 + ... + 26207939.
It is an arithmetic number, because the mean of its divisors is an integer number (1264284241584).
Almost surely, 213003443255252 is an apocalyptic number.
13003443255252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13003443255252 is an abundant number, since it is smaller than the sum of its proper divisors (17339378542764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13003443255252 is a wasteful number, since it uses less digits than its factorization.
13003443255252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51935807 (or 51935805 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 39.
Adding to 13003443255252 its reverse (25255234430031), we get a palindrome (38258677685283).
The spelling of 13003443255252 in words is "thirteen trillion, three billion, four hundred forty-three million, two hundred fifty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •