Base | Representation |
---|---|
bin | 1100001100101100000101… |
… | …0000110010100001001110 |
3 | 1202111012001102101002101212 |
4 | 3003023001100302201032 |
5 | 3224221020324131110 |
6 | 44305240403134422 |
7 | 2552665043355425 |
oct | 303130120624116 |
9 | 52435042332355 |
10 | 13412130302030 |
11 | 43010639a1599 |
12 | 160743b374412 |
13 | 7639b2451365 |
14 | 3452172442bc |
15 | 183d30e8de05 |
hex | c32c143284e |
13412130302030 has 8 divisors (see below), whose sum is σ = 24141834543672. Its totient is φ = 5364852120808.
The previous prime is 13412130301993. The next prime is 13412130302071. The reversal of 13412130302030 is 3020303121431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 13412130301987 and 13412130302005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 670606515092 + ... + 670606515111.
It is an arithmetic number, because the mean of its divisors is an integer number (3017729317959).
Almost surely, 213412130302030 is an apocalyptic number.
13412130302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13412130302030 is a deficient number, since it is larger than the sum of its proper divisors (10729704241642).
13412130302030 is a wasteful number, since it uses less digits than its factorization.
13412130302030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341213030210.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13412130302030 its reverse (3020303121431), we get a palindrome (16432433423461).
The spelling of 13412130302030 in words is "thirteen trillion, four hundred twelve billion, one hundred thirty million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •