Base | Representation |
---|---|
bin | 11001111100110011111001… |
… | …011001111111111100111001 |
3 | 112222002201121210021212102002 |
4 | 121330303321121333330321 |
5 | 104424401323131103031 |
6 | 1042422342410550345 |
7 | 33016424110562036 |
oct | 3174637131777471 |
9 | 488081553255362 |
10 | 114130055331641 |
11 | 33402314963418 |
12 | 109732047383b5 |
13 | 4b8b55857581b |
14 | 2027cd1c3038d |
15 | d2dbb8310ccb |
hex | 67ccf967ff39 |
114130055331641 has 8 divisors (see below), whose sum is σ = 119094020642880. Its totient is φ = 109166239103152.
The previous prime is 114130055331583. The next prime is 114130055331647. The reversal of 114130055331641 is 146133550031411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114130055331641 - 26 = 114130055331577 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 114130055331595 and 114130055331604.
It is not an unprimeable number, because it can be changed into a prime (114130055331647) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35704895 + ... + 38769828.
It is an arithmetic number, because the mean of its divisors is an integer number (14886752580360).
Almost surely, 2114130055331641 is an apocalyptic number.
It is an amenable number.
114130055331641 is a deficient number, since it is larger than the sum of its proper divisors (4963965311239).
114130055331641 is an equidigital number, since it uses as much as digits as its factorization.
114130055331641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74541375.
The product of its (nonzero) digits is 64800, while the sum is 38.
The spelling of 114130055331641 in words is "one hundred fourteen trillion, one hundred thirty billion, fifty-five million, three hundred thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •