Search a number
-
+
110001001111012 = 22112500022752523
BaseRepresentation
bin11001000000101110011010…
…100110001001110111100100
3112102110222210220022111020201
4121000232122212021313210
5103404224022241023022
61025541432353040244
732112211232025544
oct3100563246116744
9472428726274221
10110001001111012
1132060187452770
1210406b20856084
13494c08580a23b
141d24110c9b324
15cab5a2563127
hex640b9a989de4

110001001111012 has 12 divisors (see below), whose sum is σ = 210001911212016. Its totient is φ = 50000455050440.

The previous prime is 110001001110901. The next prime is 110001001111021. The reversal of 110001001111012 is 210111100100011.

It is a self number, because there is not a number n which added to its sum of digits gives 110001001111012.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1250011376218 + ... + 1250011376305.

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

Almost surely, 2110001001111012 is an apocalyptic number.

It is an amenable number.

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

110001001111012 is a wasteful number, since it uses less digits than its factorization.

110001001111012 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2500022752538 (or 2500022752536 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 110001001111012 its reverse (210111100100011), we get a palindrome (320112101211023).

The spelling of 110001001111012 in words is "one hundred ten trillion, one billion, one million, one hundred eleven thousand, twelve".

Divisors: 1 2 4 11 22 44 2500022752523 5000045505046 10000091010092 27500250277753 55000500555506 110001001111012