Base | Representation |
---|---|
bin | 1011111011111111101001… |
… | …0110111011101101010011 |
3 | 1201110202202111100202002120 |
4 | 2332333322112323231103 |
5 | 3210021131300430021 |
6 | 43525405150545323 |
7 | 2523162541101051 |
oct | 276777226735523 |
9 | 51422674322076 |
10 | 13125325405011 |
11 | 4200468018486 |
12 | 157b938b08243 |
13 | 7429362557c1 |
14 | 3353aa7371d1 |
15 | 17b646e202c6 |
hex | beffa5bbb53 |
13125325405011 has 16 divisors (see below), whose sum is σ = 18891023074560. Its totient is φ = 8081159868320.
The previous prime is 13125325405009. The next prime is 13125325405019. The reversal of 13125325405011 is 11050452352131.
It is a cyclic number.
It is not a de Polignac number, because 13125325405011 - 21 = 13125325405009 is a prime.
It is a super-4 number, since 4×131253254050114 (a number of 54 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (13125325405019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3279689505 + ... + 3279693506.
It is an arithmetic number, because the mean of its divisors is an integer number (1180688942160).
Almost surely, 213125325405011 is an apocalyptic number.
13125325405011 is a deficient number, since it is larger than the sum of its proper divisors (5765697669549).
13125325405011 is a wasteful number, since it uses less digits than its factorization.
13125325405011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6559383066.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 13125325405011 its reverse (11050452352131), we get a palindrome (24175777757142).
The spelling of 13125325405011 in words is "thirteen trillion, one hundred twenty-five billion, three hundred twenty-five million, four hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •