Search a number
-
+
10301270632 = 231775744637
BaseRepresentation
bin10011001100000000…
…01110101001101000
3222120220122202201221
421212000032221220
5132044111130012
64422103551424
7513163232662
oct114600165150
928526582657
1010301270632
114406887104
121bb5a5b574
13c82241713
146da187532
1540456d507
hex26600ea68

10301270632 has 16 divisors (see below), whose sum is σ = 20451052260. Its totient is φ = 4847656704.

The previous prime is 10301270593. The next prime is 10301270647. The reversal of 10301270632 is 23607210301.

It can be written as a sum of positive squares in 2 ways, for example, as 9551934756 + 749335876 = 97734^2 + 27374^2 .

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

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

It is an unprimeable number.

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

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

Almost surely, 210301270632 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 75744660 (or 75744656 counting only the distinct ones).

The product of its (nonzero) digits is 1512, while the sum is 25.

Adding to 10301270632 its reverse (23607210301), we get a palindrome (33908480933).

The spelling of 10301270632 in words is "ten billion, three hundred one million, two hundred seventy thousand, six hundred thirty-two".

Divisors: 1 2 4 8 17 34 68 136 75744637 151489274 302978548 605957096 1287658829 2575317658 5150635316 10301270632