Search a number
-
+
190971267670 = 2519097126767
BaseRepresentation
bin1011000111011011000…
…1100100101001010110
3200020221010010120010201
42301312301210221112
511112102121031140
6223421521011114
716540305664141
oct2616661445126
9606833116121
10190971267670
1173a99335a47
1231017a83a9a
131501591bc01
149358d4b058
154e7a9be49a
hex2c76c64a56

190971267670 has 8 divisors (see below), whose sum is σ = 343748281824. Its totient is φ = 76388507064.

The previous prime is 190971267649. The next prime is 190971267689. The reversal of 190971267670 is 76762179091.

190971267670 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, 9548563374 + ... + 9548563393.

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

Almost surely, 2190971267670 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 19097126774.

The product of its (nonzero) digits is 2000376, while the sum is 55.

The spelling of 190971267670 in words is "one hundred ninety billion, nine hundred seventy-one million, two hundred sixty-seven thousand, six hundred seventy".

Divisors: 1 2 5 10 19097126767 38194253534 95485633835 190971267670