Search a number
-
+
910101001001 = 6114919688541
BaseRepresentation
bin11010011111001100011…
…11110011001100101001
310020000010111121002200112
431033212033303030221
5104402341324013001
61534032234544105
7122516102604023
oct15174617631451
93200114532615
10910101001001
11320a7631a405
12128472b98035
1367a8c37a88a
1432098b1b013
1518a191dacbb
hexd3e63f3329

910101001001 has 4 divisors (see below), whose sum is σ = 925020689604. Its totient is φ = 895181312400.

The previous prime is 910101000979. The next prime is 910101001003. The reversal of 910101001001 is 100100101019.

It is a happy number.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 129007398976 + 781093602025 = 359176^2 + 883795^2 .

It is a cyclic number.

It is not a de Polignac number, because 910101001001 - 26 = 910101000937 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2910101001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14919688602.

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

The spelling of 910101001001 in words is "nine hundred ten billion, one hundred one million, one thousand, one".

Divisors: 1 61 14919688541 910101001001