Search a number
-
+
101002201101 = 333740822263
BaseRepresentation
bin101111000010000110…
…0110100100000001101
3100122201000110102201000
41132010030310200031
53123323030413401
6114222203410513
710203633354414
oct1360414644015
9318630412630
10101002201101
113992012267a
12176a9523a39
1396a833a749
144c621c247b
152962203186
hex178433480d

101002201101 has 8 divisors (see below), whose sum is σ = 149632890560. Its totient is φ = 67334800716.

The previous prime is 101002201063. The next prime is 101002201171. The reversal of 101002201101 is 101102200101.

It is a happy number.

It is not a de Polignac number, because 101002201101 - 210 = 101002200077 is a prime.

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

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1870411105 + ... + 1870411158.

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

Almost surely, 2101002201101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 101002201101 its reverse (101102200101), we get a palindrome (202104401202).

The spelling of 101002201101 in words is "one hundred one billion, two million, two hundred one thousand, one hundred one".

Divisors: 1 3 9 27 3740822263 11222466789 33667400367 101002201101