Base | Representation |
---|---|
bin | 11111111000011… |
… | …001110000010100 |
3 | 1101021110200101200 |
4 | 133320121300110 |
5 | 2043412114002 |
6 | 125024152500 |
7 | 16153253505 |
oct | 3770316024 |
9 | 1337420350 |
10 | 534879252 |
11 | 254a1a776 |
12 | 12b168730 |
13 | 86a77bcb |
14 | 51074bac |
15 | 31e57b1c |
hex | 1fe19c14 |
534879252 has 54 divisors (see below), whose sum is σ = 1389713598. Its totient is φ = 173458368.
The previous prime is 534879229. The next prime is 534879263. The reversal of 534879252 is 252978435.
It can be written as a sum of positive squares in 3 ways, for example, as 310957956 + 223921296 = 17634^2 + 14964^2 .
It is a junction number, because it is equal to n+sod(n) for n = 534879198 and 534879207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 43858 + ... + 54710.
It is an arithmetic number, because the mean of its divisors is an integer number (25735437).
Almost surely, 2534879252 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 534879252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (694856799).
534879252 is an abundant number, since it is smaller than the sum of its proper divisors (854834346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
534879252 is a wasteful number, since it uses less digits than its factorization.
534879252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10937 (or 10895 counting only the distinct ones).
The product of its digits is 604800, while the sum is 45.
The square root of 534879252 is about 23127.4566695086. The cubic root of 534879252 is about 811.7430593620.
The spelling of 534879252 in words is "five hundred thirty-four million, eight hundred seventy-nine thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •