Base | Representation |
---|---|
bin | 10111000000101010110111… |
… | …101111110110000010101001 |
3 | 111021022201201211000020210110 |
4 | 113000222313233312002221 |
5 | 101231034324130413001 |
6 | 555123051115204533 |
7 | 30213352440326265 |
oct | 2700526757660251 |
9 | 437281654006713 |
10 | 101201102201001 |
11 | 2a278167981190 |
12 | b425550446749 |
13 | 44612b8ba239a |
14 | 1adc23388d0a5 |
15 | ba77161283d6 |
hex | 5c0ab7bf60a9 |
101201102201001 has 64 divisors (see below), whose sum is σ = 148850478784512. Its totient is φ = 60648588000000.
The previous prime is 101201102200997. The next prime is 101201102201029. The reversal of 101201102201001 is 100102201102101.
It is not a de Polignac number, because 101201102201001 - 22 = 101201102200997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101201102201041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10221296151 + ... + 10221306051.
It is an arithmetic number, because the mean of its divisors is an integer number (2325788731008).
Almost surely, 2101201102201001 is an apocalyptic number.
101201102201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101201102201001 is a deficient number, since it is larger than the sum of its proper divisors (47649376583511).
101201102201001 is a wasteful number, since it uses less digits than its factorization.
101201102201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13654.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101201102201001 its reverse (100102201102101), we get a palindrome (201303303303102).
It can be divided in two parts, 101 and 201102201001, that added together give a palindrome (201102201102).
The spelling of 101201102201001 in words is "one hundred one trillion, two hundred one billion, one hundred two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •