Base | Representation |
---|---|
bin | 111001010101… |
… | …0000001111100 |
3 | 2002120000212101 |
4 | 1302222001330 |
5 | 30143302242 |
6 | 2552114444 |
7 | 513322330 |
oct | 162520174 |
9 | 62500771 |
10 | 30056572 |
11 | 15a69a47 |
12 | a095a24 |
13 | 62c4970 |
14 | 3dc57c0 |
15 | 298a9b7 |
hex | 1caa07c |
30056572 has 48 divisors (see below), whose sum is σ = 65705472. Its totient is φ = 11712960.
The previous prime is 30056563. The next prime is 30056599. The reversal of 30056572 is 27565003.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 30056572.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25263 + ... + 26425.
It is an arithmetic number, because the mean of its divisors is an integer number (1368864).
Almost surely, 230056572 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 30056572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32852736).
30056572 is an abundant number, since it is smaller than the sum of its proper divisors (35648900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30056572 is a wasteful number, since it uses less digits than its factorization.
30056572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1258 (or 1256 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 28.
The square root of 30056572 is about 5482.3874361450. The cubic root of 30056572 is about 310.9184416843.
It can be divided in two parts, 30056 and 572, that added together give a triangular number (30628 = T247).
The spelling of 30056572 in words is "thirty million, fifty-six thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •