Search a number
-
+
10301001111 = 324872350217
BaseRepresentation
bin10011001011111110…
…01100110110010111
3222120220011002000200
421211333030312113
5132044024013421
64422054111543
7513161031132
oct114577146627
928526132020
1010301001111
114406712665
121bb594b5b3
13c82178b3b
146da117219
15404518726
hex265fccd97

10301001111 has 12 divisors (see below), whose sum is σ = 14909782992. Its totient is φ = 6853229856.

The previous prime is 10301001079. The next prime is 10301001119. The reversal of 10301001111 is 11110010301.

It is not a de Polignac number, because 10301001111 - 25 = 10301001079 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1170726 + ... + 1179491.

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

Almost surely, 210301001111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 3, while the sum is 9.

Adding to 10301001111 its reverse (11110010301), we get a palindrome (21411011412).

The spelling of 10301001111 in words is "ten billion, three hundred one million, one thousand, one hundred eleven".

Divisors: 1 3 9 487 1461 4383 2350217 7050651 21151953 1144555679 3433667037 10301001111