Search a number
BaseRepresentation
bin10110111111010110111101…
…010011000010110000101010
3111021000010011111201001101000
4112333112331103002300222
5101223100312224013002
6555013430321535430
730204012601632066
oct2677267523026052
9437003144631330
10101111001001002
112a242a3111a033
12b40bba57a4576
13445595a109365
15ba51e0e5b61c
hex5bf5bd4c2c2a

101111001001002 has 64 divisors (see below), whose sum is σ = 228532521571200. Its totient is φ = 33127621188480.

The previous prime is 101111001000991. The next prime is 101111001001019. The reversal of 101111001001002 is 200100100111101.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19743502 + ... + 24331622.

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

Almost surely, 2101111001001002 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 101111001001002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114266260785600).

101111001001002 is an abundant number, since it is smaller than the sum of its proper divisors (127421520570198).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 101111001001002 its reverse (200100100111101), we get a palindrome (301211101112103).

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