Base | Representation |
---|---|
bin | 1011111011110100001100… |
… | …1111000110110111101011 |
3 | 1201110110211101022122112211 |
4 | 2332331003033012313223 |
5 | 3204443333244414201 |
6 | 43524140241145551 |
7 | 2523023444115562 |
oct | 276750317066753 |
9 | 51413741278484 |
10 | 13122253123051 |
11 | 41aa130878586 |
12 | 157b22002b2b7 |
13 | 7425668b3b97 |
14 | 3351986b6bd9 |
15 | 17b51734e651 |
hex | bef433c6deb |
13122253123051 has 4 divisors (see below), whose sum is σ = 13369842804672. Its totient is φ = 12874663441432.
The previous prime is 13122253123043. The next prime is 13122253123069. The reversal of 13122253123051 is 15032135222131.
It is a happy number.
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 13122253123051 - 23 = 13122253123043 is a prime.
It is a super-3 number, since 3×131222531230513 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13122253120051) 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, 123794840731 + ... + 123794840836.
It is an arithmetic number, because the mean of its divisors is an integer number (3342460701168).
Almost surely, 213122253123051 is an apocalyptic number.
13122253123051 is a deficient number, since it is larger than the sum of its proper divisors (247589681621).
13122253123051 is an equidigital number, since it uses as much as digits as its factorization.
13122253123051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 247589681620.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 13122253123051 its reverse (15032135222131), we get a palindrome (28154388345182).
The spelling of 13122253123051 in words is "thirteen trillion, one hundred twenty-two billion, two hundred fifty-three million, one hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •