Base | Representation |
---|---|
bin | 111010101111000… |
… | …110001000001101 |
3 | 2112200020202010220 |
4 | 322233012020031 |
5 | 4004232040042 |
6 | 241441021553 |
7 | 33263653266 |
oct | 7257061015 |
9 | 2480222126 |
10 | 985424397 |
11 | 466278a31 |
12 | 2360248b9 |
13 | 129205a79 |
14 | 94c3596d |
15 | 5b7a28ec |
hex | 3abc620d |
985424397 has 24 divisors (see below), whose sum is σ = 1456447296. Its totient is φ = 591410688.
The previous prime is 985424359. The next prime is 985424399. The reversal of 985424397 is 793424589.
985424397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 985424397 - 26 = 985424333 is a prime.
It is a super-3 number, since 3×9854243973 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (985424399) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4768 + ... + 44649.
It is an arithmetic number, because the mean of its divisors is an integer number (60685304).
Almost surely, 2985424397 is an apocalyptic number.
It is an amenable number.
985424397 is a deficient number, since it is larger than the sum of its proper divisors (471022899).
985424397 is a wasteful number, since it uses less digits than its factorization.
985424397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49477 (or 49460 counting only the distinct ones).
The product of its digits is 2177280, while the sum is 51.
The square root of 985424397 is about 31391.4701312315. The cubic root of 985424397 is about 995.1176672876.
The spelling of 985424397 in words is "nine hundred eighty-five million, four hundred twenty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •