Base | Representation |
---|---|
bin | 1011111011111011111100… |
… | …0110010101111000110011 |
3 | 1201110200012012120220021122 |
4 | 2332332333012111320303 |
5 | 3210012112241400201 |
6 | 43525122353412455 |
7 | 2523126106354241 |
oct | 276767706257063 |
9 | 51420165526248 |
10 | 13124331200051 |
11 | 41aaaa78a2595 |
12 | 157b6bbb6a12b |
13 | 742808297246 |
14 | 335314697791 |
15 | 17b5d99d5e1b |
hex | befbf195e33 |
13124331200051 has 8 divisors (see below), whose sum is σ = 13379343932304. Its totient is φ = 12869591943520.
The previous prime is 13124331200023. The next prime is 13124331200059. The reversal of 13124331200051 is 15000213342131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13124331200051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13124331200059) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 68272016 + ... + 68463981.
It is an arithmetic number, because the mean of its divisors is an integer number (1672417991538).
Almost surely, 213124331200051 is an apocalyptic number.
13124331200051 is a deficient number, since it is larger than the sum of its proper divisors (255012732253).
13124331200051 is a wasteful number, since it uses less digits than its factorization.
13124331200051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136737861.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 13124331200051 its reverse (15000213342131), we get a palindrome (28124544542182).
The spelling of 13124331200051 in words is "thirteen trillion, one hundred twenty-four billion, three hundred thirty-one million, two hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •