Search a number
-
+
10130611469 = 1114943114341
BaseRepresentation
bin10010110111101010…
…01101110100001101
3222011000112101101012
421123311031310031
5131221414031334
64353130055005
7506021530256
oct113365156415
928130471335
1010130611469
114329514380
121b6887a465
13c55a8b374
146c1641b2d
153e45ac9ce
hex25bd4dd0d

10130611469 has 16 divisors (see below), whose sum is σ = 11152339200. Its totient is φ = 9125976000.

The previous prime is 10130611459. The next prime is 10130611511. The reversal of 10130611469 is 96411603101.

It is a cyclic number.

It is not a de Polignac number, because 10130611469 - 228 = 9862176013 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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, 699239 + ... + 713579.

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

Almost surely, 210130611469 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14932.

The product of its (nonzero) digits is 3888, while the sum is 32.

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

Divisors: 1 11 149 431 1639 4741 14341 64219 157751 706409 2136809 6180971 23504899 67990681 920964679 10130611469