Base | Representation |
---|---|
bin | 1100001100100110000111… |
… | …1101010001110111010110 |
3 | 1202111000220222200000100012 |
4 | 3003021201331101313112 |
5 | 3224204232011231042 |
6 | 44304414004120222 |
7 | 2552610316460540 |
oct | 303114175216726 |
9 | 52430828600305 |
10 | 13410531352022 |
11 | 4300413377802 |
12 | 1607073996072 |
13 | 7637b90c54ac |
14 | 345104b44690 |
15 | 183c8a8eae82 |
hex | c3261f51dd6 |
13410531352022 has 16 divisors (see below), whose sum is σ = 23280488424960. Its totient is φ = 5674619052648.
The previous prime is 13410531352013. The next prime is 13410531352027. The reversal of 13410531352022 is 22025313501431.
It is a super-2 number, since 2×134105313520222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13410531352022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13410531352027) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 6062626088 + ... + 6062628299.
It is an arithmetic number, because the mean of its divisors is an integer number (1455030526560).
Almost surely, 213410531352022 is an apocalyptic number.
13410531352022 is a deficient number, since it is larger than the sum of its proper divisors (9869957072938).
13410531352022 is a wasteful number, since it uses less digits than its factorization.
13410531352022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12125254475.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 13410531352022 its reverse (22025313501431), we get a palindrome (35435844853453).
The spelling of 13410531352022 in words is "thirteen trillion, four hundred ten billion, five hundred thirty-one million, three hundred fifty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •