Base | Representation |
---|---|
bin | 11101010101101… |
… | …00001011000100 |
3 | 122011002102021120 |
4 | 32222310023010 |
5 | 1001000323042 |
6 | 40230513540 |
7 | 6045566424 |
oct | 1652641304 |
9 | 564072246 |
10 | 246104772 |
11 | 116a13181 |
12 | 6a5058b0 |
13 | 3bcaa734 |
14 | 24984484 |
15 | 16914dec |
hex | eab42c4 |
246104772 has 12 divisors (see below), whose sum is σ = 574244496. Its totient is φ = 82034920.
The previous prime is 246104731. The next prime is 246104809. The reversal of 246104772 is 277401642.
246104772 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
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, 10254354 + ... + 10254377.
It is an arithmetic number, because the mean of its divisors is an integer number (47853708).
Almost surely, 2246104772 is an apocalyptic number.
It is an amenable number.
246104772 is an abundant number, since it is smaller than the sum of its proper divisors (328139724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
246104772 is a wasteful number, since it uses less digits than its factorization.
246104772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20508738 (or 20508736 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 33.
The square root of 246104772 is about 15687.7267951734. The cubic root of 246104772 is about 626.6715973406.
The spelling of 246104772 in words is "two hundred forty-six million, one hundred four thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •