Base | Representation |
---|---|
bin | 10111010000000110011101… |
… | …000001010000010000101000 |
3 | 111102002002211111200111012210 |
4 | 113100012131001100100220 |
5 | 101400423033214431440 |
6 | 1001254142305405120 |
7 | 30353102365012350 |
oct | 2720063501202050 |
9 | 442062744614183 |
10 | 102261510702120 |
11 | 2a646954926070 |
12 | b576b710397a0 |
13 | 450a2b0424c33 |
14 | 1b376aab23b60 |
15 | bc50cadd4a80 |
hex | 5d019d050428 |
102261510702120 has 128 divisors (see below), whose sum is σ = 382484611491840. Its totient is φ = 21249145079040.
The previous prime is 102261510702089. The next prime is 102261510702133. The reversal of 102261510702120 is 21207015162201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5533622292 + ... + 5533640771.
It is an arithmetic number, because the mean of its divisors is an integer number (2988161027280).
Almost surely, 2102261510702120 is an apocalyptic number.
102261510702120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102261510702120 is an abundant number, since it is smaller than the sum of its proper divisors (280223100789720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102261510702120 is a wasteful number, since it uses less digits than its factorization.
102261510702120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11067263095 (or 11067263091 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 30.
Adding to 102261510702120 its reverse (21207015162201), we get a palindrome (123468525864321).
The spelling of 102261510702120 in words is "one hundred two trillion, two hundred sixty-one billion, five hundred ten million, seven hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •