Search a number
-
+
141310200110 = 2514131020011
BaseRepresentation
bin1000001110011010111…
…1101000100100101110
3111111202011001221102012
42003212233220210232
54303400402400420
6144530024001222
713131540611462
oct2034657504456
9444664057365
10141310200110
1154a24a18952
1223478600212
131043015b931
146ba76464a2
153a20c78dc5
hex20e6be892e

141310200110 has 8 divisors (see below), whose sum is σ = 254358360216. Its totient is φ = 56524080040.

The previous prime is 141310200103. The next prime is 141310200131. The reversal of 141310200110 is 11002013141.

141310200110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2141310200110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 14131020018.

The product of its (nonzero) digits is 24, while the sum is 14.

Adding to 141310200110 its reverse (11002013141), we get a palindrome (152312213251).

The spelling of 141310200110 in words is "one hundred forty-one billion, three hundred ten million, two hundred thousand, one hundred ten".

Divisors: 1 2 5 10 14131020011 28262040022 70655100055 141310200110