Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …0001011101111010001001 |
3 | 1201102111101121102122210211 |
4 | 2332303200301131322021 |
5 | 3204311344340020322 |
6 | 43515324054241121 |
7 | 2522211601464355 |
oct | 276634061357211 |
9 | 51374347378724 |
10 | 13112011251337 |
11 | 41a5855581799 |
12 | 15792420561a1 |
13 | 7415c3a6b96b |
14 | 3348a6392465 |
15 | 17b118115b77 |
hex | bece0c5de89 |
13112011251337 has 2 divisors, whose sum is σ = 13112011251338. Its totient is φ = 13112011251336.
The previous prime is 13112011251263. The next prime is 13112011251341. The reversal of 13112011251337 is 73315211021131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12581060026441 + 530951224896 = 3546979^2 + 728664^2 .
It is a cyclic number.
It is not a de Polignac number, because 13112011251337 - 223 = 13112002862729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13112011251299 and 13112011251308.
It is not a weakly prime, because it can be changed into another prime (13112011251397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556005625668 + 6556005625669.
It is an arithmetic number, because the mean of its divisors is an integer number (6556005625669).
Almost surely, 213112011251337 is an apocalyptic number.
It is an amenable number.
13112011251337 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112011251337 is an equidigital number, since it uses as much as digits as its factorization.
13112011251337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3780, while the sum is 31.
Adding to 13112011251337 its reverse (73315211021131), we get a palindrome (86427222272468).
The spelling of 13112011251337 in words is "thirteen trillion, one hundred twelve billion, eleven million, two hundred fifty-one thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •