Base | Representation |
---|---|
bin | 11110000111001… |
… | …110110010000000 |
3 | 1022012122102121202 |
4 | 132013032302000 |
5 | 2013313241112 |
6 | 122044240332 |
7 | 15343142243 |
oct | 3607166200 |
9 | 1265572552 |
10 | 505212032 |
11 | 23a1a7306 |
12 | 1212400a8 |
13 | 8088b540 |
14 | 4b15125a |
15 | 2e5476c2 |
hex | 1e1cec80 |
505212032 has 32 divisors (see below), whose sum is σ = 1083901980. Its totient is φ = 233174016.
The previous prime is 505212017. The next prime is 505212079. The reversal of 505212032 is 230212505.
It can be written as a sum of positive squares in 2 ways, for example, as 458645056 + 46566976 = 21416^2 + 6824^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 505211995 and 505212013.
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 3 ways as a sum of consecutive naturals, for example, 150143 + ... + 153470.
Almost surely, 2505212032 is an apocalyptic number.
505212032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
505212032 is an abundant number, since it is smaller than the sum of its proper divisors (578689948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505212032 is a wasteful number, since it uses less digits than its factorization.
505212032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303640 (or 303628 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
The square root of 505212032 is about 22476.9222092350. The cubic root of 505212032 is about 796.4488600805.
Adding to 505212032 its reverse (230212505), we get a palindrome (735424537).
The spelling of 505212032 in words is "five hundred five million, two hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •