Search a number
-
+
105674602532 = 22179147590227
BaseRepresentation
bin110001001101010110…
…0100111100000100100
3101002202122102000111212
41202122230213200210
53212410144240112
6120313553250552
710430500205132
oct1423254474044
9332678360455
10105674602532
11408a8615a64
1218592263a58
139c71357615
145186968752
152b374e8522
hex189ab27824

105674602532 has 12 divisors (see below), whose sum is σ = 185963687280. Its totient is φ = 52542120456.

The previous prime is 105674602531. The next prime is 105674602549. The reversal of 105674602532 is 235206476501.

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

It is a super-2 number, since 2×1056746025322 (a number of 23 digits) contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (105674602531) by changing a digit.

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

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

Almost surely, 2105674602532 is an apocalyptic number.

It is an amenable number.

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

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

105674602532 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 147590410 (or 147590408 counting only the distinct ones).

The product of its (nonzero) digits is 302400, while the sum is 41.

The spelling of 105674602532 in words is "one hundred five billion, six hundred seventy-four million, six hundred two thousand, five hundred thirty-two".

Divisors: 1 2 4 179 358 716 147590227 295180454 590360908 26418650633 52837301266 105674602532