Search a number
-
+
1069032071630 = 25106903207163
BaseRepresentation
bin11111000111001110100…
…01101110000111001110
310210012100200110000020202
433203213101232013032
5120003334202243010
62135035003213502
7140143416452045
oct17434721560716
93705320400222
101069032071630
1138241280a066
12153228817292
1379a6a024bc3
1439a5469d55c
151cc1bdcd6a5
hexf8e746e1ce

1069032071630 has 8 divisors (see below), whose sum is σ = 1924257728952. Its totient is φ = 427612828648.

The previous prime is 1069032071617. The next prime is 1069032071633. The reversal of 1069032071630 is 361702309601.

It is a happy number.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21069032071630 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 106903207170.

The product of its (nonzero) digits is 40824, while the sum is 38.

The spelling of 1069032071630 in words is "one trillion, sixty-nine billion, thirty-two million, seventy-one thousand, six hundred thirty".

Divisors: 1 2 5 10 106903207163 213806414326 534516035815 1069032071630