Base | Representation |
---|---|
bin | 1100001100100110000111… |
… | …1100110100101011110110 |
3 | 1202111000220222102221101112 |
4 | 3003021201330310223312 |
5 | 3224204231443420002 |
6 | 44304414001355022 |
7 | 2552610315452225 |
oct | 303114174645366 |
9 | 52430828387345 |
10 | 13410531232502 |
11 | 43004132a5a28 |
12 | 1607073938a72 |
13 | 7637b9082c81 |
14 | 345104b12cbc |
15 | 183c8a8c5852 |
hex | c3261f34af6 |
13410531232502 has 8 divisors (see below), whose sum is σ = 20606426040312. Its totient is φ = 6541722552400.
The previous prime is 13410531232367. The next prime is 13410531232507. The reversal of 13410531232502 is 20523213501431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×134105312325022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13410531232507) 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 3 ways as a sum of consecutive naturals, for example, 81771531824 + ... + 81771531987.
It is an arithmetic number, because the mean of its divisors is an integer number (2575803255039).
Almost surely, 213410531232502 is an apocalyptic number.
13410531232502 is a deficient number, since it is larger than the sum of its proper divisors (7195894807810).
13410531232502 is a wasteful number, since it uses less digits than its factorization.
13410531232502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163543063854.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 13410531232502 its reverse (20523213501431), we get a palindrome (33933744733933).
The spelling of 13410531232502 in words is "thirteen trillion, four hundred ten billion, five hundred thirty-one million, two hundred thirty-two thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •