Search a number
-
+
101114213642371 = 611759942359329
BaseRepresentation
bin10110111111011001111100…
…110010010011000010000011
3111021000102110101212010211101
4112333121330302103002003
5101223123402143023441
6555015121203555231
730204155321632336
oct2677317462230203
9437012411763741
10101114213642371
112a24432a617046
12b41074168bb17
13445604c882a97
141ad7d4dcc661d
15ba532d005231
hex5bf67cc93083

101114213642371 has 8 divisors (see below), whose sum is σ = 102830250089600. Its totient is φ = 99400061917440.

The previous prime is 101114213642357. The next prime is 101114213642423. The reversal of 101114213642371 is 173246312411101.

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

It is a cyclic number.

It is not a de Polignac number, because 101114213642371 - 25 = 101114213642339 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 2101114213642371 is an apocalyptic number.

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

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

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

The sum of its prime factors is 942361149.

The product of its (nonzero) digits is 24192, while the sum is 37.

The spelling of 101114213642371 in words is "one hundred one trillion, one hundred fourteen billion, two hundred thirteen million, six hundred forty-two thousand, three hundred seventy-one".

Divisors: 1 61 1759 107299 942359329 57483919069 1657610059711 101114213642371