Base | Representation |
---|---|
bin | 101101111100… |
… | …111111111000 |
3 | 211200000110022 |
4 | 231330333320 |
5 | 11040440303 |
6 | 1110110012 |
7 | 204251330 |
oct | 55747770 |
9 | 24600408 |
10 | 12046328 |
11 | 6888648 |
12 | 404b308 |
13 | 265a108 |
14 | 18580c0 |
15 | 10ce438 |
hex | b7cff8 |
12046328 has 32 divisors (see below), whose sum is σ = 26114400. Its totient is φ = 5102592.
The previous prime is 12046301. The next prime is 12046337. The reversal of 12046328 is 82364021.
It is a super-2 number, since 2×120463282 = 290228036567168, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12046297 and 12046306.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3776 + ... + 6192.
It is an arithmetic number, because the mean of its divisors is an integer number (816075).
Almost surely, 212046328 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 12046328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13057200).
12046328 is an abundant number, since it is smaller than the sum of its proper divisors (14068072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12046328 is a wasteful number, since it uses less digits than its factorization.
12046328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2519 (or 2515 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 12046328 is about 3470.7820444390. The cubic root of 12046328 is about 229.2370941814.
The spelling of 12046328 in words is "twelve million, forty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •