Base | Representation |
---|---|
bin | 110111001010100111000101… |
… | …0000110001001001110110100 |
3 | 2100122002211002202002012010202 |
4 | 1232111032022012021032310 |
5 | 1002100212014303020033 |
6 | 4440005430345340032 |
7 | 204131452322146235 |
oct | 15625161206111664 |
9 | 2318084082065122 |
10 | 485243427001268 |
11 | 1306826442aa291 |
12 | 4650b515a97618 |
13 | 17a9b349833840 |
14 | 87b7c9b42d08c |
15 | 3b17465ed28e8 |
hex | 1b9538a1893b4 |
485243427001268 has 24 divisors (see below), whose sum is σ = 914735813426568. Its totient is φ = 223900075639296.
The previous prime is 485243427001247. The next prime is 485243427001283. The reversal of 485243427001268 is 862100724342584.
It can be written as a sum of positive squares in 4 ways, for example, as 1396622876944 + 483846804124324 = 1181788^2 + 21996518^2 .
It is a super-2 number, since 2×4852434270012682 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1217072321 + ... + 1217470952.
It is an arithmetic number, because the mean of its divisors is an integer number (38113992226107).
Almost surely, 2485243427001268 is an apocalyptic number.
It is an amenable number.
485243427001268 is a deficient number, since it is larger than the sum of its proper divisors (429492386425300).
485243427001268 is a wasteful number, since it uses less digits than its factorization.
485243427001268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2434547123 (or 2434547121 counting only the distinct ones).
The product of its (nonzero) digits is 20643840, while the sum is 56.
The spelling of 485243427001268 in words is "four hundred eighty-five trillion, two hundred forty-three billion, four hundred twenty-seven million, one thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •