Base | Representation |
---|---|
bin | 11100111011100… |
… | …101110100000111 |
3 | 1020211100000220010 |
4 | 130323211310013 |
5 | 1443224232211 |
6 | 120055241303 |
7 | 15012456021 |
oct | 3473456407 |
9 | 1224300803 |
10 | 485383431 |
11 | 229a93835 |
12 | 116679233 |
13 | 79738140 |
14 | 4866d011 |
15 | 2c92c4a6 |
hex | 1cee5d07 |
485383431 has 32 divisors (see below), whose sum is σ = 707857920. Its totient is φ = 294067584.
The previous prime is 485383403. The next prime is 485383433. The reversal of 485383431 is 134383584.
It is not a de Polignac number, because 485383431 - 211 = 485381383 is a prime.
It is a super-4 number, since 4×4853834314 (a number of 36 digits) contains 4444 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 (39).
It is a self number, because there is not a number n which added to its sum of digits gives 485383431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485383433) 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 31 ways as a sum of consecutive naturals, for example, 964726 + ... + 965228.
It is an arithmetic number, because the mean of its divisors is an integer number (22120560).
Almost surely, 2485383431 is an apocalyptic number.
485383431 is a deficient number, since it is larger than the sum of its proper divisors (222474489).
485383431 is a wasteful number, since it uses less digits than its factorization.
485383431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855.
The product of its digits is 138240, while the sum is 39.
The square root of 485383431 is about 22031.4191780738. The cubic root of 485383431 is about 785.8897944536.
The spelling of 485383431 in words is "four hundred eighty-five million, three hundred eighty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •