Search a number
-
+
1001110011002 = 22707184911343
BaseRepresentation
bin11101001000101101100…
…11100111110001111010
310112201001002002211022122
432210112303213301322
5112400233130323002
62043523101521242
7132220303455503
oct16442663476172
93481032084278
101001110011002
11356628558662
12142031873222
137353424309a
143664da2dbaa
151b093e286a2
hexe916ce7c7a

1001110011002 has 8 divisors (see below), whose sum is σ = 1502219758656. Its totient is φ = 500370091452.

The previous prime is 1001110010993. The next prime is 1001110011023. The reversal of 1001110011002 is 2001100111001.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is an unprimeable number.

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, 92450258 + ... + 92461085.

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

Almost surely, 21001110011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 184914052.

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

Adding to 1001110011002 its reverse (2001100111001), we get a palindrome (3002210122003).

Subtracting 1001110011002 from its reverse (2001100111001), we obtain a palindrome (999990099999).

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

Divisors: 1 2 2707 5414 184911343 369822686 500555005501 1001110011002