Base | Representation |
---|---|
bin | 1100000110010010001110… |
… | …1010101010101101001000 |
3 | 1202002200002001201111222112 |
4 | 3001210203222222231020 |
5 | 3220420211144300430 |
6 | 44142523403241452 |
7 | 2542021511200322 |
oct | 301444352525510 |
9 | 52080061644875 |
10 | 13302112103240 |
11 | 4269437551464 |
12 | 15aa056519288 |
13 | 7564cb251b4c |
14 | 33db7b884612 |
15 | 18104249e195 |
hex | c1923aaab48 |
13302112103240 has 16 divisors (see below), whose sum is σ = 29929752232380. Its totient is φ = 5320844841280.
The previous prime is 13302112103227. The next prime is 13302112103261. The reversal of 13302112103240 is 4230121120331.
It can be written as a sum of positive squares in 2 ways, for example, as 11660900017636 + 1641212085604 = 3414806^2 + 1281098^2 .
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 3 ways as a sum of consecutive naturals, for example, 166276401251 + ... + 166276401330.
Almost surely, 213302112103240 is an apocalyptic number.
13302112103240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13302112103240 is an abundant number, since it is smaller than the sum of its proper divisors (16627640129140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13302112103240 is a wasteful number, since it uses less digits than its factorization.
13302112103240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332552802592 (or 332552802588 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13302112103240 its reverse (4230121120331), we get a palindrome (17532233223571).
The spelling of 13302112103240 in words is "thirteen trillion, three hundred two billion, one hundred twelve million, one hundred three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •