Base | Representation |
---|---|
bin | 1011111100100001111101… |
… | …1000001101011011100011 |
3 | 1201111122112102112100210112 |
4 | 2333020133120031123203 |
5 | 3210144012311300311 |
6 | 43533531151121535 |
7 | 2523640025402150 |
oct | 277103730153343 |
9 | 51448472470715 |
10 | 13134536431331 |
11 | 4204364442927 |
12 | 15816898132ab |
13 | 743773650b33 |
14 | 335a01ba1227 |
15 | 17b9d58d328b |
hex | bf21f60d6e3 |
13134536431331 has 4 divisors (see below), whose sum is σ = 15010898778672. Its totient is φ = 11258174083992.
The previous prime is 13134536431327. The next prime is 13134536431363. The reversal of 13134536431331 is 13313463543131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13134536431331 - 22 = 13134536431327 is a prime.
It is a super-2 number, since 2×131345364313312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13134536430331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 938181173660 + ... + 938181173673.
It is an arithmetic number, because the mean of its divisors is an integer number (3752724694668).
Almost surely, 213134536431331 is an apocalyptic number.
13134536431331 is a deficient number, since it is larger than the sum of its proper divisors (1876362347341).
13134536431331 is an equidigital number, since it uses as much as digits as its factorization.
13134536431331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876362347340.
The product of its digits is 349920, while the sum is 41.
Adding to 13134536431331 its reverse (13313463543131), we get a palindrome (26447999974462).
The spelling of 13134536431331 in words is "thirteen trillion, one hundred thirty-four billion, five hundred thirty-six million, four hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •