Search a number
-
+
100001101112002 = 250000550556001
BaseRepresentation
bin10110101111001101010010…
…000110111110001011000010
3111010002000022200020210222201
4112233031102012332023002
5101101404223341041002
6552403512135223414
730030561336346306
oct2657152206761302
9433060280223881
10100001101112002
11299552576109a2
12b270a72517b6a
1343a50a92c5acc
141a9a11715dd06
15b863d12c5087
hex5af3521be2c2

100001101112002 has 4 divisors (see below), whose sum is σ = 150001651668006. Its totient is φ = 50000550556000.

The previous prime is 100001101111999. The next prime is 100001101112089. The reversal of 100001101112002 is 200211101100001.

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., 82317133348641 + 17683967763361 = 9072879^2 + 4205231^2 .

It is a super-2 number, since 2×1000011011120022 (a number of 29 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 100001101112002.

It is an unprimeable number.

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

Almost surely, 2100001101112002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 50000550556003.

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

Adding to 100001101112002 its reverse (200211101100001), we get a palindrome (300212202212003).

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

Divisors: 1 2 50000550556001 100001101112002