Base | Representation |
---|---|
bin | 10110111111001110100101… |
… | …100001011111010001000001 |
3 | 111020222020222001200122111102 |
4 | 112333032211201133101001 |
5 | 101222423410110400001 |
6 | 555005342340424145 |
7 | 30203244053243141 |
oct | 2677164541372101 |
9 | 436866861618442 |
10 | 101102012200001 |
11 | 2a23a13918787a |
12 | b40a2b73a8055 |
13 | 4454b56a7a5b7 |
14 | 1ad751362c921 |
15 | ba4d66c42e6b |
hex | 5bf3a585f441 |
101102012200001 has 4 divisors (see below), whose sum is σ = 101116032733104. Its totient is φ = 101087991666900.
The previous prime is 101102012199977. The next prime is 101102012200051. The reversal of 101102012200001 is 100002210201101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101102012200001 - 210 = 101102012198977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101102012200051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7010255735 + ... + 7010270156.
It is an arithmetic number, because the mean of its divisors is an integer number (25279008183276).
Almost surely, 2101102012200001 is an apocalyptic number.
It is an amenable number.
101102012200001 is a deficient number, since it is larger than the sum of its proper divisors (14020533103).
101102012200001 is an equidigital number, since it uses as much as digits as its factorization.
101102012200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14020533102.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101102012200001 its reverse (100002210201101), we get a palindrome (201104222401102).
The spelling of 101102012200001 in words is "one hundred one trillion, one hundred two billion, twelve million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •