Base | Representation |
---|---|
bin | 1110101001010111000… |
… | …01010111110001010000 |
3 | 1210002221202100221121102 |
4 | 13110223201113301100 |
5 | 31221114240421112 |
6 | 1023104052243532 |
7 | 51233534554202 |
oct | 7245341276120 |
9 | 1702852327542 |
10 | 503241342032 |
11 | 184472688770 |
12 | 816466105a8 |
13 | 385bc832c40 |
14 | 1a4dd8d0772 |
15 | d15549abc2 |
hex | 752b857c50 |
503241342032 has 80 divisors (see below), whose sum is σ = 1172129437248. Its totient is φ = 206239703040.
The previous prime is 503241342031. The next prime is 503241342041. The reversal of 503241342032 is 230243142305.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 503241341986 and 503241342004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (503241342031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2459153 + ... + 2655920.
Almost surely, 2503241342032 is an apocalyptic number.
503241342032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
503241342032 is an abundant number, since it is smaller than the sum of its proper divisors (668888095216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
503241342032 is a wasteful number, since it uses less digits than its factorization.
503241342032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5115148 (or 5115142 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 29.
Adding to 503241342032 its reverse (230243142305), we get a palindrome (733484484337).
The spelling of 503241342032 in words is "five hundred three billion, two hundred forty-one million, three hundred forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •