Base | Representation |
---|---|
bin | 10110111111001110101011… |
… | …111101100011010101100001 |
3 | 111020222021020120221122002011 |
4 | 112333032223331203111201 |
5 | 101222424120234020001 |
6 | 555005401155552521 |
7 | 30203246534350225 |
oct | 2677165375432541 |
9 | 436867216848064 |
10 | 101102120220001 |
11 | 2a23a1941568aa |
12 | b40a3275bb741 |
13 | 4454b7326b664 |
14 | 1ad7523b0a785 |
15 | ba4d7147dd51 |
hex | 5bf3abf63561 |
101102120220001 has 8 divisors (see below), whose sum is σ = 107049412197504. Its totient is φ = 95154840290880.
The previous prime is 101102120219981. The next prime is 101102120220029. The reversal of 101102120220001 is 100022021201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101102120220001 - 29 = 101102120219489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101102120200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18761116 + ... + 23541106.
It is an arithmetic number, because the mean of its divisors is an integer number (13381176524688).
Almost surely, 2101102120220001 is an apocalyptic number.
It is an amenable number.
101102120220001 is a deficient number, since it is larger than the sum of its proper divisors (5947291977503).
101102120220001 is a wasteful number, since it uses less digits than its factorization.
101102120220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6024191.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101102120220001 its reverse (100022021201101), we get a palindrome (201124141421102).
The spelling of 101102120220001 in words is "one hundred one trillion, one hundred two billion, one hundred twenty million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •