Search a number
-
+
10130365606 = 210946469567
BaseRepresentation
bin10010110111101000…
…10001110010100110
3222011000001220010011
421123310101302212
5131221333144411
64353120520434
7506016454414
oct113364216246
928130056104
1010130365606
114329366689
121b6878011a
13c55a0349a
146c15ba2b4
153e455ec21
hex25bd11ca6

10130365606 has 8 divisors (see below), whose sum is σ = 15334957440. Its totient is φ = 5018713128.

The previous prime is 10130365577. The next prime is 10130365607. The reversal of 10130365606 is 60656303101.

10130365606 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 super-2 number, since 2×101303656062 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 210130365606 is an apocalyptic number.

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

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

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

The sum of its prime factors is 46469678.

The product of its (nonzero) digits is 9720, while the sum is 31.

Adding to 10130365606 its reverse (60656303101), we get a palindrome (70786668707).

The spelling of 10130365606 in words is "ten billion, one hundred thirty million, three hundred sixty-five thousand, six hundred six".

Divisors: 1 2 109 218 46469567 92939134 5065182803 10130365606