Base | Representation |
---|---|
bin | 101111100110111111… |
… | …1000101101101000101 |
3 | 100202220021211000001101 |
4 | 1133031333011231011 |
5 | 3133341432144100 |
6 | 114545104300101 |
7 | 10246414433362 |
oct | 1371577055505 |
9 | 322807730041 |
10 | 102240115525 |
11 | 3a3a5975049 |
12 | 17994011631 |
13 | 98449483a2 |
14 | 4d3c781469 |
15 | 29d5c2c86a |
hex | 17cdfc5b45 |
102240115525 has 12 divisors (see below), whose sum is σ = 131149390500. Its totient is φ = 78971674880.
The previous prime is 102240115513. The next prime is 102240115561. The reversal of 102240115525 is 525511042201.
It can be written as a sum of positive squares in 6 ways, for example, as 4376880964 + 97863234561 = 66158^2 + 312831^2 .
It is not a de Polignac number, because 102240115525 - 25 = 102240115493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102240115493 and 102240115502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 70509700 + ... + 70511149.
It is an arithmetic number, because the mean of its divisors is an integer number (10929115875).
Almost surely, 2102240115525 is an apocalyptic number.
It is an amenable number.
102240115525 is a deficient number, since it is larger than the sum of its proper divisors (28909274975).
102240115525 is a wasteful number, since it uses less digits than its factorization.
102240115525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141020888 (or 141020883 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 102240115525 its reverse (525511042201), we get a palindrome (627751157726).
The spelling of 102240115525 in words is "one hundred two billion, two hundred forty million, one hundred fifteen thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •