Base | Representation |
---|---|
bin | 1100000001110011… |
… | …0000110101001000 |
3 | 22100000111021121212 |
4 | 3000130300311020 |
5 | 23103030444022 |
6 | 1252215352252 |
7 | 143004024350 |
oct | 30034606510 |
9 | 8300437555 |
10 | 3228765512 |
11 | 1407610355 |
12 | 761382688 |
13 | 3c5c0094b |
14 | 228b55b60 |
15 | 13d6d13e2 |
hex | c0730d48 |
3228765512 has 64 divisors (see below), whose sum is σ = 7062940800. Its totient is φ = 1355028480.
The previous prime is 3228765509. The next prime is 3228765517. The reversal of 3228765512 is 2155678223.
It is a self number, because there is not a number n which added to its sum of digits gives 3228765512.
It is not an unprimeable number, because it can be changed into a prime (3228765517) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2756687 + ... + 2757857.
It is an arithmetic number, because the mean of its divisors is an integer number (110358450).
Almost surely, 23228765512 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 3228765512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3531470400).
3228765512 is an abundant number, since it is smaller than the sum of its proper divisors (3834175288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3228765512 is a wasteful number, since it uses less digits than its factorization.
3228765512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2166 (or 2162 counting only the distinct ones).
The product of its digits is 201600, while the sum is 41.
The square root of 3228765512 is about 56822.2272706729. The cubic root of 3228765512 is about 1478.0149782138.
The spelling of 3228765512 in words is "three billion, two hundred twenty-eight million, seven hundred sixty-five thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •