Base | Representation |
---|---|
bin | 1100001111110… |
… | …00111011011101 |
3 | 21011022022002211 |
4 | 12013320323131 |
5 | 202244401420 |
6 | 14105520421 |
7 | 2355126463 |
oct | 607707335 |
9 | 234268084 |
10 | 102731485 |
11 | 52a9775a |
12 | 2a4a3111 |
13 | 1838bb7c |
14 | d902833 |
15 | 9043e5a |
hex | 61f8edd |
102731485 has 8 divisors (see below), whose sum is σ = 127528920. Its totient is φ = 79351104.
The previous prime is 102731483. The next prime is 102731549. The reversal of 102731485 is 584137201.
It can be written as a sum of positive squares in 4 ways, for example, as 20629764 + 82101721 = 4542^2 + 9061^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102731485 - 21 = 102731483 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102731483) by changing a digit.
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, 354102 + ... + 354391.
It is an arithmetic number, because the mean of its divisors is an integer number (15941115).
Almost surely, 2102731485 is an apocalyptic number.
It is an amenable number.
102731485 is a deficient number, since it is larger than the sum of its proper divisors (24797435).
102731485 is an equidigital number, since it uses as much as digits as its factorization.
102731485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708527.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 102731485 is about 10135.6541476118. The cubic root of 102731485 is about 468.3471214503.
Adding to 102731485 its reverse (584137201), we get a palindrome (686868686).
The spelling of 102731485 in words is "one hundred two million, seven hundred thirty-one thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •