Base | Representation |
---|---|
bin | 1011111101101110111110… |
… | …1111101011100111111111 |
3 | 1201120121220100110220000021 |
4 | 2333123233233223213333 |
5 | 3211013333300130211 |
6 | 43551230534513011 |
7 | 2525301263661502 |
oct | 277335757534777 |
9 | 51517810426007 |
10 | 13155212114431 |
11 | 4212104312632 |
12 | 1585699b05767 |
13 | 7456ba00284a |
14 | 336a03ad1139 |
15 | 17c2e5b1b771 |
hex | bf6efbeb9ff |
13155212114431 has 8 divisors (see below), whose sum is σ = 13525301758320. Its totient is φ = 12785887911168.
The previous prime is 13155212114413. The next prime is 13155212114477. The reversal of 13155212114431 is 13441121255131.
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 13155212114431 - 25 = 13155212114399 is a prime.
It is a super-2 number, since 2×131552121144312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13155212114531) 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, 191325301 + ... + 191394046.
It is an arithmetic number, because the mean of its divisors is an integer number (1690662719790).
Almost surely, 213155212114431 is an apocalyptic number.
13155212114431 is a deficient number, since it is larger than the sum of its proper divisors (370089643889).
13155212114431 is an equidigital number, since it uses as much as digits as its factorization.
13155212114431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382720313.
The product of its digits is 14400, while the sum is 34.
Adding to 13155212114431 its reverse (13441121255131), we get a palindrome (26596333369562).
The spelling of 13155212114431 in words is "thirteen trillion, one hundred fifty-five billion, two hundred twelve million, one hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •