Base | Representation |
---|---|
bin | 10111001101111010010001… |
… | …111100011000011001100001 |
3 | 111101112201100020011102220201 |
4 | 113031322101330120121201 |
5 | 101340441312230120001 |
6 | 1001101051332505201 |
7 | 30336163536560401 |
oct | 2715722174303141 |
9 | 441481306142821 |
10 | 102111001020001 |
11 | 2a59903a058226 |
12 | b55196777b201 |
13 | 44c90453b072c |
14 | 1b302ad7ba801 |
15 | bc121c6c8501 |
hex | 5cde91f18661 |
102111001020001 has 8 divisors (see below), whose sum is σ = 107555838959520. Its totient is φ = 96673220553312.
The previous prime is 102111001019983. The next prime is 102111001020029. The reversal of 102111001020001 is 100020100111201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102111001020001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102111001020001.
It is not an unprimeable number, because it can be changed into a prime (102111001020401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1764338500 + ... + 1764396373.
It is an arithmetic number, because the mean of its divisors is an integer number (13444479869940).
Almost surely, 2102111001020001 is an apocalyptic number.
It is an amenable number.
102111001020001 is a deficient number, since it is larger than the sum of its proper divisors (5444837939519).
102111001020001 is a wasteful number, since it uses less digits than its factorization.
102111001020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3528736415.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102111001020001 its reverse (100020100111201), we get a palindrome (202131101131202).
The spelling of 102111001020001 in words is "one hundred two trillion, one hundred eleven billion, one million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •