Base | Representation |
---|---|
bin | 11001111100100100000110… |
… | …110111001010101110000001 |
3 | 112222001002212020010101021012 |
4 | 121330210012313022232001 |
5 | 104424112112402300140 |
6 | 1042410500205210305 |
7 | 33015254012131301 |
oct | 3174440667125601 |
9 | 488032766111235 |
10 | 114113101212545 |
11 | 333a6104791846 |
12 | 1096ba72860995 |
13 | 4b89a85c279a6 |
14 | 2027164295601 |
15 | d2d524b9d265 |
hex | 67c906dcab81 |
114113101212545 has 8 divisors (see below), whose sum is σ = 138585549424896. Its totient is φ = 90190595656816.
The previous prime is 114113101212521. The next prime is 114113101212563. The reversal of 114113101212545 is 545212101311411.
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 114113101212545 - 222 = 114113097018241 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 137485663697 + ... + 137485664526.
It is an arithmetic number, because the mean of its divisors is an integer number (17323193678112).
Almost surely, 2114113101212545 is an apocalyptic number.
It is an amenable number.
114113101212545 is a deficient number, since it is larger than the sum of its proper divisors (24472448212351).
114113101212545 is an equidigital number, since it uses as much as digits as its factorization.
114113101212545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274971328311.
The product of its (nonzero) digits is 4800, while the sum is 32.
Adding to 114113101212545 its reverse (545212101311411), we get a palindrome (659325202523956).
The spelling of 114113101212545 in words is "one hundred fourteen trillion, one hundred thirteen billion, one hundred one million, two hundred twelve thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •