Base | Representation |
---|---|
bin | 1011111011111011100000… |
… | …0100010000010010010000 |
3 | 1201110122212222120111112002 |
4 | 2332332320010100102100 |
5 | 3210011342040243204 |
6 | 43525102540453132 |
7 | 2523123144443525 |
oct | 276767004202220 |
9 | 51418788514462 |
10 | 13124213212304 |
11 | 41aaa47235657 |
12 | 157b68854a1a8 |
13 | 7427b99c61cc |
14 | 335302b4314c |
15 | 17b5ce47b91e |
hex | befb8110490 |
13124213212304 has 10 divisors (see below), whose sum is σ = 25428163098870. Its totient is φ = 6562106606144.
The previous prime is 13124213212301. The next prime is 13124213212321. The reversal of 13124213212304 is 40321231242131.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 13023437440000 + 100775772304 = 3608800^2 + 317452^2 .
It is not an unprimeable number, because it can be changed into a prime (13124213212301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 410131662869 + ... + 410131662900.
It is an arithmetic number, because the mean of its divisors is an integer number (2542816309887).
Almost surely, 213124213212304 is an apocalyptic number.
It is an amenable number.
13124213212304 is a deficient number, since it is larger than the sum of its proper divisors (12303949886566).
13124213212304 is an equidigital number, since it uses as much as digits as its factorization.
13124213212304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820263325777 (or 820263325771 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 13124213212304 its reverse (40321231242131), we get a palindrome (53445444454435).
The spelling of 13124213212304 in words is "thirteen trillion, one hundred twenty-four billion, two hundred thirteen million, two hundred twelve thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •