Base | Representation |
---|---|
bin | 10111001101110001001001… |
… | …110100101010010010110000 |
3 | 111101111210001020220000200202 |
4 | 113031301021310222102300 |
5 | 101340311224440231000 |
6 | 1001052351054334332 |
7 | 30335365641624032 |
oct | 2715611164522260 |
9 | 441453036800622 |
10 | 102101201102000 |
11 | 2a594970281841 |
12 | b54ba917ba3a8 |
13 | 44c8142ca8999 |
14 | 1b2da2005bc52 |
15 | bc0d4718ddd5 |
hex | 5cdc49d2a4b0 |
102101201102000 has 320 divisors, whose sum is σ = 266544382710528. Its totient is φ = 37686159360000.
The previous prime is 102101201101997. The next prime is 102101201102023. The reversal of 102101201102000 is 201102101201.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 644934854 + ... + 645093146.
Almost surely, 2102101201102000 is an apocalyptic number.
102101201102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102101201102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133272191355264).
102101201102000 is an abundant number, since it is smaller than the sum of its proper divisors (164443181608528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101201102000 is a wasteful number, since it uses less digits than its factorization.
102101201102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158705 (or 158689 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102101201102000 its reverse (201102101201), we get a palindrome (102302303203201).
The spelling of 102101201102000 in words is "one hundred two trillion, one hundred one billion, two hundred one million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •