Search a number
-
+
10121111001 = 33374855963
BaseRepresentation
bin10010110110100001…
…11110010111011001
3222010100122201012000
421123100332113121
5131212001023001
64352150311213
7505545011151
oct113320762731
928110581160
1010121111001
114324115551
121b65658509
13c53b12ca1
146c028b761
153e3832a86
hex25b43e5d9

10121111001 has 8 divisors (see below), whose sum is σ = 14994238560. Its totient is φ = 6747407316.

The previous prime is 10121110963. The next prime is 10121111009. The reversal of 10121111001 is 10011112101.

It is not a de Polignac number, because 10121111001 - 219 = 10120586713 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10121111009) 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 7 ways as a sum of consecutive naturals, for example, 187427955 + ... + 187428008.

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

Almost surely, 210121111001 is an apocalyptic number.

It is an amenable number.

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

10121111001 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 10121111001 its reverse (10011112101), we get a palindrome (20132223102).

The spelling of 10121111001 in words is "ten billion, one hundred twenty-one million, one hundred eleven thousand, one".

Divisors: 1 3 9 27 374855963 1124567889 3373703667 10121111001