Base | Representation |
---|---|
bin | 101111100100000010… |
… | …1011110001010010001 |
3 | 100202122101112202221110 |
4 | 1133020011132022101 |
5 | 3133141112002030 |
6 | 114531210443533 |
7 | 10244103145134 |
oct | 1371005361221 |
9 | 322571482843 |
10 | 102141125265 |
11 | 3a355003213 |
12 | 17966a335a9 |
13 | 982a29937a |
14 | 4d2d57421b |
15 | 29cc1c71b0 |
hex | 17c815e291 |
102141125265 has 8 divisors (see below), whose sum is σ = 163425800448. Its totient is φ = 54475266800.
The previous prime is 102141125231. The next prime is 102141125311. The reversal of 102141125265 is 562521141201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102141125265 - 27 = 102141125137 is a prime.
It is a super-3 number, since 3×1021411252653 (a number of 34 digits) contains 333 as substring.
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 7 ways as a sum of consecutive naturals, for example, 3404704161 + ... + 3404704190.
It is an arithmetic number, because the mean of its divisors is an integer number (20428225056).
Almost surely, 2102141125265 is an apocalyptic number.
102141125265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
102141125265 is a deficient number, since it is larger than the sum of its proper divisors (61284675183).
102141125265 is an equidigital number, since it uses as much as digits as its factorization.
102141125265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6809408359.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 102141125265 its reverse (562521141201), we get a palindrome (664662266466).
The spelling of 102141125265 in words is "one hundred two billion, one hundred forty-one million, one hundred twenty-five thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •