Search a number
-
+
12001201011 = 321333466779
BaseRepresentation
bin10110010110101001…
…11100101101110011
31010222101101011211100
423023110330231303
5144034301413021
65302511215443
7603254345142
oct131324745563
933871334740
1012001201011
1150a9401a48
1223ab217583
131193495397
1481bc51759
154a390b626
hex2cb53cb73

12001201011 has 6 divisors (see below), whose sum is σ = 17335068140. Its totient is φ = 8000800668.

The previous prime is 12001201007. The next prime is 12001201019. The reversal of 12001201011 is 11010210021.

It is a happy number.

It is not a de Polignac number, because 12001201011 - 22 = 12001201007 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1333466779 = 12001201011 / (1 + 2 + 0 + 0 + 1 + 2 + 0 + 1 + 0 + 1 + 1).

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 666733381 + ... + 666733398.

Almost surely, 212001201011 is an apocalyptic number.

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

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

12001201011 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 12001201011 its reverse (11010210021), we get a palindrome (23011411032).

The spelling of 12001201011 in words is "twelve billion, one million, two hundred one thousand, eleven".

Divisors: 1 3 9 1333466779 4000400337 12001201011