Search a number
-
+
1101010022001 = 3467202876363
BaseRepresentation
bin10000000001011001010…
…011111010111001110001
310220020220021121012110000
4100001121103322321301
5121014332031201001
62201444053500213
7142355024526051
oct20013123727161
93806807535400
101101010022001
11394a324aa51a
12159472041669
137ca95114026
143b4096a3561
151d98e4b1a86
hex100594fae71

1101010022001 has 20 divisors (see below), whose sum is σ = 1669266722992. Its totient is φ = 723051354168.

The previous prime is 1101010021963. The next prime is 1101010022023. The reversal of 1101010022001 is 1002200101011.

It is a happy number.

It is a de Polignac number, because none of the positive numbers 2k-1101010022001 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 101432755 + ... + 101443608.

Almost surely, 21101010022001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1101010022001 its reverse (1002200101011), we get a palindrome (2103210123012).

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

Divisors: 1 3 9 27 67 81 201 603 1809 5427 202876363 608629089 1825887267 5477661801 13592716321 16432985403 40778148963 122334446889 367003340667 1101010022001