Base | Representation |
---|---|
bin | 1011111011101111101110… |
… | …1001100100111100011110 |
3 | 1201110100201200101110222121 |
4 | 2332323323221210330132 |
5 | 3204433403314234210 |
6 | 43523421135133154 |
7 | 2522651621446666 |
oct | 276737351447436 |
9 | 51410650343877 |
10 | 13121052102430 |
11 | 41a9674934a58 |
12 | 157ab459741ba |
13 | 742404b22cac |
14 | 3350c2d9d1a6 |
15 | 17b496bb16da |
hex | beefba64f1e |
13121052102430 has 8 divisors (see below), whose sum is σ = 23617893784392. Its totient is φ = 5248420840968.
The previous prime is 13121052102331. The next prime is 13121052102461. The reversal of 13121052102430 is 3420125012131.
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 = 13121052102395 and 13121052102404.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 656052605112 + ... + 656052605131.
It is an arithmetic number, because the mean of its divisors is an integer number (2952236723049).
Almost surely, 213121052102430 is an apocalyptic number.
13121052102430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13121052102430 is a deficient number, since it is larger than the sum of its proper divisors (10496841681962).
13121052102430 is a wasteful number, since it uses less digits than its factorization.
13121052102430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312105210250.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 13121052102430 its reverse (3420125012131), we get a palindrome (16541177114561).
The spelling of 13121052102430 in words is "thirteen trillion, one hundred twenty-one billion, fifty-two million, one hundred two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •