Base | Representation |
---|---|
bin | 1011111011111111111100… |
… | …0100011010000000010011 |
3 | 1201110202222000001212002212 |
4 | 2332333333010122000103 |
5 | 3210021312013400301 |
6 | 43525421052502335 |
7 | 2523164520612431 |
oct | 276777704320023 |
9 | 51422860055085 |
10 | 13125404434451 |
11 | 42004a8696471 |
12 | 157b95b47a9ab |
13 | 74294973619a |
14 | 3353b7029d51 |
15 | 17b64dd314bb |
hex | befff11a013 |
13125404434451 has 8 divisors (see below), whose sum is σ = 13255897050000. Its totient is φ = 12994922370400.
The previous prime is 13125404434427. The next prime is 13125404434459. The reversal of 13125404434451 is 15443440452131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13125404434451 - 214 = 13125404418067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13125404434399 and 13125404434408.
It is not an unprimeable number, because it can be changed into a prime (13125404434459) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125801 + ... + 5125098.
It is an arithmetic number, because the mean of its divisors is an integer number (1656987131250).
Almost surely, 213125404434451 is an apocalyptic number.
13125404434451 is a deficient number, since it is larger than the sum of its proper divisors (130492615549).
13125404434451 is a wasteful number, since it uses less digits than its factorization.
13125404434451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5275749.
The product of its (nonzero) digits is 460800, while the sum is 41.
Adding to 13125404434451 its reverse (15443440452131), we get a palindrome (28568844886582).
The spelling of 13125404434451 in words is "thirteen trillion, one hundred twenty-five billion, four hundred four million, four hundred thirty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •