Base | Representation |
---|---|
bin | 1011010000101111… |
… | …1101111110101000 |
3 | 21210200101011020110 |
4 | 2310023331332220 |
5 | 22142344130303 |
6 | 1215550054320 |
7 | 134625245664 |
oct | 26413757650 |
9 | 7720334213 |
10 | 3023036328 |
11 | 1311474a34 |
12 | 7044aa3a0 |
13 | 3923bb9c0 |
14 | 2096c18a4 |
15 | 12a5e4703 |
hex | b42fdfa8 |
3023036328 has 128 divisors (see below), whose sum is σ = 8462160000. Its totient is φ = 893555712.
The previous prime is 3023036293. The next prime is 3023036347. The reversal of 3023036328 is 8236303203.
It is a junction number, because it is equal to n+sod(n) for n = 3023036295 and 3023036304.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2071263 + ... + 2072721.
It is an arithmetic number, because the mean of its divisors is an integer number (66110625).
Almost surely, 23023036328 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 3023036328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4231080000).
3023036328 is an abundant number, since it is smaller than the sum of its proper divisors (5439123672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3023036328 is a wasteful number, since it uses less digits than its factorization.
3023036328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1739 (or 1735 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 30.
The square root of 3023036328 is about 54982.1455383473. The cubic root of 3023036328 is about 1445.9317319591.
The spelling of 3023036328 in words is "three billion, twenty-three million, thirty-six thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •