Base | Representation |
---|---|
bin | 1100000011011111001011… |
… | …1110010010001100111001 |
3 | 1201221002000120101012212212 |
4 | 3000313302332102030321 |
5 | 3214123243413200123 |
6 | 44104454324544505 |
7 | 2535400504405055 |
oct | 300676276221471 |
9 | 51832016335785 |
10 | 13254050521913 |
11 | 4250013a95013 |
12 | 15a0882852135 |
13 | 751b0bc77826 |
14 | 33b6dc77cc65 |
15 | 17eb7cda5878 |
hex | c0df2f92339 |
13254050521913 has 2 divisors, whose sum is σ = 13254050521914. Its totient is φ = 13254050521912.
The previous prime is 13254050521871. The next prime is 13254050521931. The reversal of 13254050521913 is 31912505045231.
Together with next prime (13254050521931) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12936481079824 + 317569442089 = 3596732^2 + 563533^2 .
It is a cyclic number.
It is not a de Polignac number, because 13254050521913 - 224 = 13254033744697 is a prime.
It is not a weakly prime, because it can be changed into another prime (13254050529913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6627025260956 + 6627025260957.
It is an arithmetic number, because the mean of its divisors is an integer number (6627025260957).
Almost surely, 213254050521913 is an apocalyptic number.
It is an amenable number.
13254050521913 is a deficient number, since it is larger than the sum of its proper divisors (1).
13254050521913 is an equidigital number, since it uses as much as digits as its factorization.
13254050521913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 13254050521913 in words is "thirteen trillion, two hundred fifty-four billion, fifty million, five hundred twenty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •