Base | Representation |
---|---|
bin | 1010000010010… |
… | …1001101111101 |
3 | 2221012200011001 |
4 | 2200211031331 |
5 | 41234023420 |
6 | 4102130301 |
7 | 1020543235 |
oct | 240451575 |
9 | 87180131 |
10 | 42095485 |
11 | 21841a63 |
12 | 12120991 |
13 | 894b593 |
14 | 583acc5 |
15 | 3a67b0a |
hex | 282537d |
42095485 has 8 divisors (see below), whose sum is σ = 53486136. Its totient is φ = 31695360.
The previous prime is 42095453. The next prime is 42095491. The reversal of 42095485 is 58459024.
42095485 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2732409 + 39363076 = 1653^2 + 6274^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42095485 - 25 = 42095453 is a prime.
It is a super-3 number, since 3×420954853 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 247536 + ... + 247705.
It is an arithmetic number, because the mean of its divisors is an integer number (6685767).
Almost surely, 242095485 is an apocalyptic number.
It is an amenable number.
42095485 is a deficient number, since it is larger than the sum of its proper divisors (11390651).
42095485 is a wasteful number, since it uses less digits than its factorization.
42095485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495263.
The product of its (nonzero) digits is 57600, while the sum is 37.
The square root of 42095485 is about 6488.1033438132. The cubic root of 42095485 is about 347.8658844850.
The spelling of 42095485 in words is "forty-two million, ninety-five thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •