Base | Representation |
---|---|
bin | 11001111111111000011110… |
… | …100100000001111010010001 |
3 | 112222211220110002111110221021 |
4 | 121333320132210001322101 |
5 | 104441331114310144401 |
6 | 1043103331350555441 |
7 | 33040605562621606 |
oct | 3177703644017221 |
9 | 488756402443837 |
10 | 114341132115601 |
11 | 33483890237326 |
12 | 109a80b1968b81 |
13 | 4ba5426694921 |
14 | 20341d708c6ad |
15 | d3441de402a1 |
hex | 67fe1e901e91 |
114341132115601 has 4 divisors (see below), whose sum is σ = 114427688613604. Its totient is φ = 114254575617600.
The previous prime is 114341132115559. The next prime is 114341132115647. The reversal of 114341132115601 is 106511231143411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 77666783391376 + 36674348724225 = 8812876^2 + 6055935^2 .
It is a cyclic number.
It is not a de Polignac number, because 114341132115601 - 213 = 114341132107409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114341132112601) 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, 43278247020 + ... + 43278249661.
It is an arithmetic number, because the mean of its divisors is an integer number (28606922153401).
Almost surely, 2114341132115601 is an apocalyptic number.
It is an amenable number.
114341132115601 is a deficient number, since it is larger than the sum of its proper divisors (86556498003).
114341132115601 is an equidigital number, since it uses as much as digits as its factorization.
114341132115601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86556498002.
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 114341132115601 in words is "one hundred fourteen trillion, three hundred forty-one billion, one hundred thirty-two million, one hundred fifteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •