Base | Representation |
---|---|
bin | 11111101101010… |
… | …011011110010110 |
3 | 1101001222212120110 |
4 | 133231103132112 |
5 | 2042141014232 |
6 | 124441543450 |
7 | 16116445530 |
oct | 3755233626 |
9 | 1331885513 |
10 | 531969942 |
11 | 253312989 |
12 | 12a1a4b86 |
13 | 8629991a |
14 | 50918850 |
15 | 31a80acc |
hex | 1fb53796 |
531969942 has 128 divisors (see below), whose sum is σ = 1348300800. Its totient is φ = 136515456.
The previous prime is 531969937. The next prime is 531969943. The reversal of 531969942 is 249969135.
It is a junction number, because it is equal to n+sod(n) for n = 531969891 and 531969900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531969943) 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 63 ways as a sum of consecutive naturals, for example, 1269409 + ... + 1269827.
It is an arithmetic number, because the mean of its divisors is an integer number (10533600).
Almost surely, 2531969942 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 531969942, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (674150400).
531969942 is an abundant number, since it is smaller than the sum of its proper divisors (816330858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
531969942 is a wasteful number, since it uses less digits than its factorization.
531969942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530.
The product of its digits is 524880, while the sum is 48.
The square root of 531969942 is about 23064.4735903510. The cubic root of 531969942 is about 810.2686412702.
The spelling of 531969942 in words is "five hundred thirty-one million, nine hundred sixty-nine thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •