Base | Representation |
---|---|
bin | 10111000000101010111101… |
… | …101001000111110100010101 |
3 | 111021022201222201002221121011 |
4 | 113000222331221013310111 |
5 | 101231040024440231401 |
6 | 555123105011052221 |
7 | 30213355051063552 |
oct | 2700527551076425 |
9 | 437281881087534 |
10 | 101201201102101 |
11 | 2a278208792031 |
12 | b4255795a1071 |
13 | 446130351c949 |
14 | 1adc242a75a29 |
15 | ba771eb62451 |
hex | 5c0abda47d15 |
101201201102101 has 16 divisors (see below), whose sum is σ = 103521720221568. Its totient is φ = 98902097611200.
The previous prime is 101201201102041. The next prime is 101201201102117. The reversal of 101201201102101 is 101201102102101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101201201102101 - 227 = 101201066884373 is a prime.
It is a super-2 number, since 2×1012012011021012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201201102191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160684656 + ... + 161313238.
It is an arithmetic number, because the mean of its divisors is an integer number (6470107513848).
Almost surely, 2101201201102101 is an apocalyptic number.
It is an amenable number.
101201201102101 is a deficient number, since it is larger than the sum of its proper divisors (2320519119467).
101201201102101 is a wasteful number, since it uses less digits than its factorization.
101201201102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645612.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101201201102101 its reverse (101201102102101), we get a palindrome (202402303204202).
The spelling of 101201201102101 in words is "one hundred one trillion, two hundred one billion, two hundred one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •