Base | Representation |
---|---|
bin | 11001111100011011000111… |
… | …001101010110011111010101 |
3 | 112222000011221011011012120022 |
4 | 121330123013031112133111 |
5 | 104423432322444222014 |
6 | 1042402222003514525 |
7 | 33014462460513113 |
oct | 3174330715263725 |
9 | 488004834135508 |
10 | 114103443351509 |
11 | 333a1aa9112907 |
12 | 1096a018388a45 |
13 | 4b88ba70a0611 |
14 | 20268c9754ab3 |
15 | d2d15bd74a8e |
hex | 67c6c73567d5 |
114103443351509 has 2 divisors, whose sum is σ = 114103443351510. Its totient is φ = 114103443351508.
The previous prime is 114103443351487. The next prime is 114103443351533. The reversal of 114103443351509 is 905153344301411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105993922762225 + 8109520589284 = 10295335^2 + 2847722^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114103443351509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114103443351509.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114103443350509) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57051721675754 + 57051721675755.
It is an arithmetic number, because the mean of its divisors is an integer number (57051721675755).
Almost surely, 2114103443351509 is an apocalyptic number.
It is an amenable number.
114103443351509 is a deficient number, since it is larger than the sum of its proper divisors (1).
114103443351509 is an equidigital number, since it uses as much as digits as its factorization.
114103443351509 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 388800, while the sum is 44.
The spelling of 114103443351509 in words is "one hundred fourteen trillion, one hundred three billion, four hundred forty-three million, three hundred fifty-one thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •