Search a number
-
+
20014653105110 = 252001465310511
BaseRepresentation
bin1001000110100000001100…
…10010011110001111010110
32121212101022120212101000102
410203100012102132033112
510110410002143330420
6110322334341014102
74134003522245636
oct443200622361726
977771276771012
1020014653105110
116417191995864
1222b2b829b4332
13b224b1cc3031
144d2a003826c6
1524a9614c6a75
hex12340649e3d6

20014653105110 has 8 divisors (see below), whose sum is σ = 36026375589216. Its totient is φ = 8005861242040.

The previous prime is 20014653105103. The next prime is 20014653105113. The reversal of 20014653105110 is 1150135641002.

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

It is a super-2 number, since 2×200146531051102 (a number of 27 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 220014653105110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2001465310518.

The product of its (nonzero) digits is 3600, while the sum is 29.

Adding to 20014653105110 its reverse (1150135641002), we get a palindrome (21164788746112).

The spelling of 20014653105110 in words is "twenty trillion, fourteen billion, six hundred fifty-three million, one hundred five thousand, one hundred ten".

Divisors: 1 2 5 10 2001465310511 4002930621022 10007326552555 20014653105110