Base | Representation |
---|---|
bin | 1100001101110100001111… |
… | …0011000110100000010100 |
3 | 1202120001001100021001201110 |
4 | 3003131003303012200110 |
5 | 3230030203023012202 |
6 | 44322202423255020 |
7 | 2554252044666120 |
oct | 303350363064024 |
9 | 52501040231643 |
10 | 13431500204052 |
11 | 43092a3785687 |
12 | 160b1462aa470 |
13 | 76577b422948 |
14 | 34613398a580 |
15 | 1845b674426c |
hex | c3743cc6814 |
13431500204052 has 48 divisors (see below), whose sum is σ = 36321803384832. Its totient is φ = 3783521182560.
The previous prime is 13431500204047. The next prime is 13431500204077. The reversal of 13431500204052 is 25040200513431.
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 15 ways as a sum of consecutive naturals, for example, 1126042008 + ... + 1126053935.
It is an arithmetic number, because the mean of its divisors is an integer number (756704237184).
Almost surely, 213431500204052 is an apocalyptic number.
13431500204052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13431500204052 is an abundant number, since it is smaller than the sum of its proper divisors (22890303180780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13431500204052 is a wasteful number, since it uses less digits than its factorization.
13431500204052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2252096028 (or 2252096026 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 13431500204052 its reverse (25040200513431), we get a palindrome (38471700717483).
The spelling of 13431500204052 in words is "thirteen trillion, four hundred thirty-one billion, five hundred million, two hundred four thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •