Base | Representation |
---|---|
bin | 1101000011101101… |
… | …1011110000100101 |
3 | 100001021201200212101 |
4 | 3100323123300211 |
5 | 24134320204000 |
6 | 1335453252101 |
7 | 152602025611 |
oct | 32073336045 |
9 | 10037650771 |
10 | 3505241125 |
11 | 15396875a1 |
12 | 819a94031 |
13 | 43b283099 |
14 | 253764341 |
15 | 157ae4e6a |
hex | d0edbc25 |
3505241125 has 32 divisors (see below), whose sum is σ = 4691831040. Its totient is φ = 2606385600.
The previous prime is 3505241111. The next prime is 3505241137. The reversal of 3505241125 is 5211425053.
It is not a de Polignac number, because 3505241125 - 217 = 3505110053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3505241093 and 3505241102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111952 + ... + 139798.
It is an arithmetic number, because the mean of its divisors is an integer number (146619720).
Almost surely, 23505241125 is an apocalyptic number.
It is an amenable number.
3505241125 is a deficient number, since it is larger than the sum of its proper divisors (1186589915).
3505241125 is a wasteful number, since it uses less digits than its factorization.
3505241125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27934 (or 27924 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 3505241125 is about 59205.0768515674. The cubic root of 3505241125 is about 1519.0519718835.
Adding to 3505241125 its reverse (5211425053), we get a palindrome (8716666178).
It can be divided in two parts, 350524 and 1125, that added together give a square (351649 = 5932).
The spelling of 3505241125 in words is "three billion, five hundred five million, two hundred forty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •