Search a number
-
+
1030651415230 = 25433238025731
BaseRepresentation
bin11101111111101111001…
…11001000101010111110
310122112021212110122120011
432333313213020222332
5113341233230241410
62105250312413434
7134314334324443
oct16776747105276
93575255418504
101030651415230
11368107944918
121478b70a727a
13762615bbb28
1437c531bd9ca
151bc2266718a
hexeff79c8abe

1030651415230 has 16 divisors (see below), whose sum is σ = 1859457018384. Its totient is φ = 411308461440.

The previous prime is 1030651415173. The next prime is 1030651415267. The reversal of 1030651415230 is 325141560301.

It is a junction number, because it is equal to n+sod(n) for n = 1030651415192 and 1030651415201.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119008536 + ... + 119017195.

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

Almost surely, 21030651415230 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 238026171.

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

Adding to 1030651415230 its reverse (325141560301), we get a palindrome (1355792975531).

The spelling of 1030651415230 in words is "one trillion, thirty billion, six hundred fifty-one million, four hundred fifteen thousand, two hundred thirty".

Divisors: 1 2 5 10 433 866 2165 4330 238025731 476051462 1190128655 2380257310 103065141523 206130283046 515325707615 1030651415230