Search a number
-
+
110060011060010 = 25111000545555091
BaseRepresentation
bin11001000001100101010111…
…110111001111101100101010
3112102200122010101221111100022
4121001211113313033230222
5103411210400312410020
61030024512053040442
732116400450230304
oct3101452767175452
9472618111844308
10110060011060010
1132083208a91860
121041644b026122
1349547cb10181b
141d26d0c072974
15cacda7dec625
hex641957dcfb2a

110060011060010 has 16 divisors (see below), whose sum is σ = 216117839899872. Its totient is φ = 40021822203600.

The previous prime is 110060011060009. The next prime is 110060011060039. The reversal of 110060011060010 is 10060110060011.

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

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500272777436 + ... + 500272777655.

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

Almost surely, 2110060011060010 is an apocalyptic number.

110060011060010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1000545555109.

The product of its (nonzero) digits is 36, while the sum is 17.

Subtracting from 110060011060010 its reverse (10060110060011), we obtain a palindrome (99999900999999).

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

Divisors: 1 2 5 10 11 22 55 110 1000545555091 2001091110182 5002727775455 10005455550910 11006001106001 22012002212002 55030005530005 110060011060010