Search a number
-
+
1010011111002 = 23318703909463
BaseRepresentation
bin11101011001010010101…
…10100111111001011010
310120120000102002120001000
432230221112213321122
5113022000321023002
62051554231205430
7132654005535405
oct16545126477132
93516012076030
101010011111002
1135a385a39853
121438b6816876
137432237646a
1436c55c5cd3c
151b4155bb61c
hexeb295a7e5a

1010011111002 has 16 divisors (see below), whose sum is σ = 2244469135680. Its totient is φ = 336670370316.

The previous prime is 1010011110989. The next prime is 1010011111003. The reversal of 1010011111002 is 2001111100101.

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 (1010011111003) 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 7 ways as a sum of consecutive naturals, for example, 9351954678 + ... + 9351954785.

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

Almost surely, 21010011111002 is an apocalyptic number.

1010011111002 is an abundant number, since it is smaller than the sum of its proper divisors (1234458024678).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 1010011111002 its reverse (2001111100101), we get a palindrome (3011122211103).

The spelling of 1010011111002 in words is "one trillion, ten billion, eleven million, one hundred eleven thousand, two".

Divisors: 1 2 3 6 9 18 27 54 18703909463 37407818926 56111728389 112223456778 168335185167 336670370334 505005555501 1010011111002