Search a number
-
+
111213146752057 = 756328219524677
BaseRepresentation
bin11001010010010111010100…
…000110110100010000111001
3112120202212120102012002112101
4121102113110012310100321
5104034104011032031212
61032310340404543401
732265612311002030
oct3122272406642071
9476685512162471
10111213146752057
113248825a025729
1210581a299b1b61
134a0947c49059c
141d66a604b5717
15cccd9868c157
hex6525d41b4439

111213146752057 has 8 divisors (see below), whose sum is σ = 127326495347136. Its totient is φ = 95156237207472.

The previous prime is 111213146752051. The next prime is 111213146752061. The reversal of 111213146752057 is 750257641312111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 111213146752057 - 219 = 111213146227769 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 111213146751998 and 111213146752016.

It is not an unprimeable number, because it can be changed into a prime (111213146752051) 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, 14109758398 + ... + 14109766279.

It is an arithmetic number, because the mean of its divisors is an integer number (15915811918392).

Almost surely, 2111213146752057 is an apocalyptic number.

It is an amenable number.

111213146752057 is a deficient number, since it is larger than the sum of its proper divisors (16113348595079).

111213146752057 is an equidigital number, since it uses as much as digits as its factorization.

111213146752057 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 28219525247.

The product of its (nonzero) digits is 352800, while the sum is 46.

The spelling of 111213146752057 in words is "one hundred eleven trillion, two hundred thirteen billion, one hundred forty-six million, seven hundred fifty-two thousand, fifty-seven".

Divisors: 1 7 563 3941 28219524677 197536672739 15887592393151 111213146752057