Search a number
-
+
1001101121002 = 2500550560501
BaseRepresentation
bin11101001000101100100…
…01101101010111101010
310112201000110101011112101
432210112101231113222
5112400223341333002
62043522143204014
7132220135061233
oct16442621552752
93481013334471
101001101121002
11356623536454
1214202a8a660a
137353244c828
143664c79808a
151b09326e587
hexe91646d5ea

1001101121002 has 4 divisors (see below), whose sum is σ = 1501651681506. Its totient is φ = 500550560500.

The previous prime is 1001101120979. The next prime is 1001101121003. The reversal of 1001101121002 is 2001211011001.

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

It can be written as a sum of positive squares in only one way, i.e., 858459693961 + 142641427041 = 926531^2 + 377679^2 .

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

It is a self number, because there is not a number n which added to its sum of digits gives 1001101121002.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250275280249 + ... + 250275280252.

Almost surely, 21001101121002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 500550560503.

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

Adding to 1001101121002 its reverse (2001211011001), we get a palindrome (3002312132003).

The spelling of 1001101121002 in words is "one trillion, one billion, one hundred one million, one hundred twenty-one thousand, two".

Divisors: 1 2 500550560501 1001101121002