Base | Representation |
---|---|
bin | 1100001100101111010111… |
… | …0100101011001010001110 |
3 | 1202111021022212200022011000 |
4 | 3003023311310223022032 |
5 | 3224224322100434202 |
6 | 44305504103441130 |
7 | 2553025641625020 |
oct | 303136564531216 |
9 | 52437285608130 |
10 | 13413012124302 |
11 | 430147673872a |
12 | 16076467561a6 |
13 | 763ac3051b9b |
14 | 34529c3cc010 |
15 | 183d835c991c |
hex | c32f5d2b28e |
13413012124302 has 64 divisors (see below), whose sum is σ = 34083040227840. Its totient is φ = 3830236331328.
The previous prime is 13413012124297. The next prime is 13413012124429. The reversal of 13413012124302 is 20342121031431.
13413012124302 is a `hidden beast` number, since 1 + 3 + 4 + 13 + 0 + 1 + 212 + 430 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 8797263 + ... + 10208714.
It is an arithmetic number, because the mean of its divisors is an integer number (532547503560).
Almost surely, 213413012124302 is an apocalyptic number.
13413012124302 is an abundant number, since it is smaller than the sum of its proper divisors (20670028103538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13413012124302 is a wasteful number, since it uses less digits than its factorization.
13413012124302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19007862 (or 19007856 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 13413012124302 its reverse (20342121031431), we get a palindrome (33755133155733).
The spelling of 13413012124302 in words is "thirteen trillion, four hundred thirteen billion, twelve million, one hundred twenty-four thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •