Search a number
-
+
196925473070 = 2523856197709
BaseRepresentation
bin1011011101100110101…
…1000100000100101110
3200211022002000112102122
42313121223010010232
511211300410114240
6230244420152542
720140665621434
oct2673153040456
9624262015378
10196925473070
1176574328657
12321b9b38752
1315754372781
149761a38d54
1551c85ad4b5
hex2dd9ac412e

196925473070 has 16 divisors (see below), whose sum is σ = 369877410720. Its totient is φ = 75345398304.

The previous prime is 196925473061. The next prime is 196925473099. The reversal of 196925473070 is 70374529691.

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

It is a super-3 number, since 3×1969254730703 (a number of 35 digits) contains 333 as substring.

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 7 ways as a sum of consecutive naturals, for example, 428098625 + ... + 428099084.

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

Almost surely, 2196925473070 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 856197739.

The product of its (nonzero) digits is 2857680, while the sum is 53.

The spelling of 196925473070 in words is "one hundred ninety-six billion, nine hundred twenty-five million, four hundred seventy-three thousand, seventy".

Divisors: 1 2 5 10 23 46 115 230 856197709 1712395418 4280988545 8561977090 19692547307 39385094614 98462736535 196925473070