Base | Representation |
---|---|
bin | 10000001100111110110… |
… | …011010000110110010101 |
3 | 10221110000020220110022221 |
4 | 100030332303100312111 |
5 | 121220321214433123 |
6 | 2211302325022341 |
7 | 143305222106431 |
oct | 20147663206625 |
9 | 3843006813287 |
10 | 1113450155413 |
11 | 39a236648912 |
12 | 15b9642549b1 |
13 | 80cc84cc60b |
14 | 3bc699319c1 |
15 | 1de6b6c225d |
hex | 1033ecd0d95 |
1113450155413 has 2 divisors, whose sum is σ = 1113450155414. Its totient is φ = 1113450155412.
The previous prime is 1113450155309. The next prime is 1113450155449. The reversal of 1113450155413 is 3145510543111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 909730624804 + 203719530609 = 953798^2 + 451353^2 .
It is an emirp because it is prime and its reverse (3145510543111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1113450155413 - 229 = 1112913284501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113450155483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556725077706 + 556725077707.
It is an arithmetic number, because the mean of its divisors is an integer number (556725077707).
Almost surely, 21113450155413 is an apocalyptic number.
It is an amenable number.
1113450155413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113450155413 is an equidigital number, since it uses as much as digits as its factorization.
1113450155413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 34.
Adding to 1113450155413 its reverse (3145510543111), we get a palindrome (4258960698524).
The spelling of 1113450155413 in words is "one trillion, one hundred thirteen billion, four hundred fifty million, one hundred fifty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •