Base | Representation |
---|---|
bin | 1010001100000… |
… | …10100110111101 |
3 | 12221211022021211 |
4 | 11012002212331 |
5 | 133340012004 |
6 | 12251524421 |
7 | 2055323410 |
oct | 506024675 |
9 | 187738254 |
10 | 85469629 |
11 | 44277663 |
12 | 24759711 |
13 | 14926b5b |
14 | b4cbb77 |
15 | 7784504 |
hex | 51829bd |
85469629 has 4 divisors (see below), whose sum is σ = 97679584. Its totient is φ = 73259676.
The previous prime is 85469627. The next prime is 85469647. The reversal of 85469629 is 92696458.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 92696458 = 2 ⋅46348229.
It is not a de Polignac number, because 85469629 - 21 = 85469627 is a prime.
It is a super-3 number, since 3×854696293 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85469621) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 6104967 + ... + 6104980.
It is an arithmetic number, because the mean of its divisors is an integer number (24419896).
Almost surely, 285469629 is an apocalyptic number.
It is an amenable number.
85469629 is a deficient number, since it is larger than the sum of its proper divisors (12209955).
85469629 is a wasteful number, since it uses less digits than its factorization.
85469629 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12209954.
The product of its digits is 933120, while the sum is 49.
The square root of 85469629 is about 9244.9785829930. The cubic root of 85469629 is about 440.4912368242.
The spelling of 85469629 in words is "eighty-five million, four hundred sixty-nine thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •