Base | Representation |
---|---|
bin | 101111101111011111… |
… | …0101101110100010000 |
3 | 100210122011022100001210 |
4 | 1133132332231310100 |
5 | 3134432424332402 |
6 | 115033251300120 |
7 | 10256446036056 |
oct | 1373676556420 |
9 | 323564270053 |
10 | 102525230352 |
11 | 3a531902036 |
12 | 17a535aa640 |
13 | 988ba33b9c |
14 | 4d6859c1d6 |
15 | 2a00c9b06c |
hex | 17defadd10 |
102525230352 has 20 divisors (see below), whose sum is σ = 264856845200. Its totient is φ = 34175076768.
The previous prime is 102525230347. The next prime is 102525230363. The reversal of 102525230352 is 253032525201.
It is a super-2 number, since 2×1025252303522 (a number of 23 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 1067971102 + ... + 1067971197.
It is an arithmetic number, because the mean of its divisors is an integer number (13242842260).
Almost surely, 2102525230352 is an apocalyptic number.
102525230352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102525230352 is an abundant number, since it is smaller than the sum of its proper divisors (162331614848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102525230352 is a wasteful number, since it uses less digits than its factorization.
102525230352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2135942310 (or 2135942304 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 102525230352 its reverse (253032525201), we get a palindrome (355557755553).
The spelling of 102525230352 in words is "one hundred two billion, five hundred twenty-five million, two hundred thirty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •