Base | Representation |
---|---|
bin | 10111001101110010110110… |
… | …011011000010010001011100 |
3 | 111101111221202020022011110221 |
4 | 113031302312123002101130 |
5 | 101340323442403213040 |
6 | 1001053251542211124 |
7 | 30335462044434364 |
oct | 2715626633022134 |
9 | 441457666264427 |
10 | 102103023101020 |
11 | 2a5957157a1657 |
12 | b5502bba23aa4 |
13 | 44c83735cc006 |
14 | 1b2db5401d9a4 |
15 | bc0e020e074a |
hex | 5cdcb66c245c |
102103023101020 has 24 divisors (see below), whose sum is σ = 214421058629568. Its totient is φ = 40840312075200.
The previous prime is 102103023100979. The next prime is 102103023101063. The reversal of 102103023101020 is 20101320301201.
It is a junction number, because it is equal to n+sod(n) for n = 102103023100985 and 102103023101003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55139236 + ... + 56960875.
It is an arithmetic number, because the mean of its divisors is an integer number (8934210776232).
Almost surely, 2102103023101020 is an apocalyptic number.
102103023101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102103023101020 is an abundant number, since it is smaller than the sum of its proper divisors (112318035528548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102103023101020 is a wasteful number, since it uses less digits than its factorization.
102103023101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112145661 (or 112145659 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102103023101020 its reverse (20101320301201), we get a palindrome (122204343402221).
The spelling of 102103023101020 in words is "one hundred two trillion, one hundred three billion, twenty-three million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •