Search a number
-
+
1069476130 = 253131111093
BaseRepresentation
bin111111101111101…
…110100100100010
32202112102000110001
4333233232210202
54142241214010
6254042330214
735334253132
oct7757564442
92675360401
101069476130
114a9767278
1225a1b996a
13140754418
14a2074ac2
1563d56c3a
hex3fbee922

1069476130 has 32 divisors (see below), whose sum is σ = 1993724928. Its totient is φ = 412622400.

The previous prime is 1069476113. The next prime is 1069476169. The reversal of 1069476130 is 316749601.

It is a super-2 number, since 2×10694761302 = 2287558385279553800, which contains 22 as substring.

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

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

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

Almost surely, 21069476130 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11442.

The product of its (nonzero) digits is 27216, while the sum is 37.

The square root of 1069476130 is about 32702.8459006246. The cubic root of 1069476130 is about 1022.6421727093.

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

Divisors: 1 2 5 10 31 62 155 310 311 622 1555 3110 9641 11093 19282 22186 48205 55465 96410 110930 343883 687766 1719415 3438830 3449923 6899846 17249615 34499230 106947613 213895226 534738065 1069476130