Base | Representation |
---|---|
bin | 1011111011110100110011… |
… | …0100110011101111101101 |
3 | 1201110111020121001002210022 |
4 | 2332331030310303233231 |
5 | 3204444200441014013 |
6 | 43524204225251525 |
7 | 2523030436423103 |
oct | 276751464635755 |
9 | 51414217032708 |
10 | 13122414001133 |
11 | 41aa20366a678 |
12 | 157b265a93ba5 |
13 | 742591021208 |
14 | 3351b1bd3c73 |
15 | 17b52652c008 |
hex | bef4cd33bed |
13122414001133 has 8 divisors (see below), whose sum is σ = 14217444445248. Its totient is φ = 12063286194624.
The previous prime is 13122414001091. The next prime is 13122414001217. The reversal of 13122414001133 is 33110041422131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13122414001133 - 26 = 13122414001069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122414001933) 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, 8975658641 + ... + 8975660102.
It is an arithmetic number, because the mean of its divisors is an integer number (1777180555656).
Almost surely, 213122414001133 is an apocalyptic number.
It is an amenable number.
13122414001133 is a deficient number, since it is larger than the sum of its proper divisors (1095030444115).
13122414001133 is a wasteful number, since it uses less digits than its factorization.
13122414001133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17951318803.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 13122414001133 its reverse (33110041422131), we get a palindrome (46232455423264).
The spelling of 13122414001133 in words is "thirteen trillion, one hundred twenty-two billion, four hundred fourteen million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •