Search a number
-
+
112000561510670 = 2571600008021581
BaseRepresentation
bin11001011101110100101001…
…101011101111100100001110
3112200120011000200222022220122
4121131310221223233210032
5104140004122221320140
61034112203031544542
732406526216010150
oct3135645153574416
9480504020868818
10112000561510670
1132761198140288
121068a56152b152
134a657b8c76361
141d92bdb1d8ad0
15ce35d1b58ab5
hex65dd29aef90e

112000561510670 has 16 divisors (see below), whose sum is σ = 230401155107808. Its totient is φ = 38400192517920.

The previous prime is 112000561510597. The next prime is 112000561510693. The reversal of 112000561510670 is 76015165000211.

It is a Harshad number since it is a multiple of its sum of digits (35).

It is a Curzon number.

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

It is a congruent number.

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, 800004010721 + ... + 800004010860.

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

Almost surely, 2112000561510670 is an apocalyptic number.

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

112000561510670 is an abundant number, since it is smaller than the sum of its proper divisors (118400593597138).

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

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

The sum of its prime factors is 1600008021595.

The product of its (nonzero) digits is 12600, while the sum is 35.

The spelling of 112000561510670 in words is "one hundred twelve trillion, five hundred sixty-one million, five hundred ten thousand, six hundred seventy".

Divisors: 1 2 5 7 10 14 35 70 1600008021581 3200016043162 8000040107905 11200056151067 16000080215810 22400112302134 56000280755335 112000561510670