Search a number
-
+
10301463051 = 3112003155849
BaseRepresentation
bin10011001100000001…
…11101101000001011
3222120221000112200120
421212000331220023
5132044133304201
64422112034323
7513164663655
oct114600755013
928527015616
1010301463051
1144069a8730
121bb5b329a3
13c822ab189
146da1d76d5
154045aa536
hex26603da0b

10301463051 has 16 divisors (see below), whose sum is σ = 14991523200. Its totient is φ = 6240153920.

The previous prime is 10301463049. The next prime is 10301463101. The reversal of 10301463051 is 15036410301.

It is not a de Polignac number, because 10301463051 - 21 = 10301463049 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11826 + ... + 144023.

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

Almost surely, 210301463051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 157866.

The product of its (nonzero) digits is 1080, while the sum is 24.

Adding to 10301463051 its reverse (15036410301), we get a palindrome (25337873352).

The spelling of 10301463051 in words is "ten billion, three hundred one million, four hundred sixty-three thousand, fifty-one".

Divisors: 1 3 11 33 2003 6009 22033 66099 155849 467547 1714339 5143017 312165547 936496641 3433821017 10301463051