Base | Representation |
---|---|
bin | 101011110101111… |
… | …0011010010110101 |
3 | 10210112010121221100 |
4 | 1113223303102311 |
5 | 11003100200320 |
6 | 401550440313 |
7 | 51312100350 |
oct | 12753632265 |
9 | 3715117840 |
10 | 1471100085 |
11 | 6954412a4 |
12 | 350803099 |
13 | 1a5a13c30 |
14 | dd53d297 |
15 | 8923b790 |
hex | 57af34b5 |
1471100085 has 48 divisors (see below), whose sum is σ = 3138355584. Its totient is φ = 620770176.
The previous prime is 1471100077. The next prime is 1471100087. The reversal of 1471100085 is 5800011741.
It is not a de Polignac number, because 1471100085 - 23 = 1471100077 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1471100087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 175527 + ... + 183716.
It is an arithmetic number, because the mean of its divisors is an integer number (65382408).
Almost surely, 21471100085 is an apocalyptic number.
1471100085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1471100085 is an abundant number, since it is smaller than the sum of its proper divisors (1667255499).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1471100085 is a wasteful number, since it uses less digits than its factorization.
1471100085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359274 (or 359271 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 27.
The square root of 1471100085 is about 38354.9225654283. The cubic root of 1471100085 is about 1137.3149295978.
The spelling of 1471100085 in words is "one billion, four hundred seventy-one million, one hundred thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •