Base | Representation |
---|---|
bin | 1100010101100001… |
… | …0110011011011000 |
3 | 22112210011100222020 |
4 | 3011120112123120 |
5 | 23240220313442 |
6 | 1304332454440 |
7 | 145030146000 |
oct | 30530263330 |
9 | 8483140866 |
10 | 3311494872 |
11 | 144a286124 |
12 | 78501a420 |
13 | 40a0a842a |
14 | 235b2d000 |
15 | 145ac39ec |
hex | c56166d8 |
3311494872 has 128 divisors (see below), whose sum is σ = 10222848000. Its totient is φ = 890448384.
The previous prime is 3311494843. The next prime is 3311494873. The reversal of 3311494872 is 2784941133.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3311494873) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128113 + ... + 151775.
It is an arithmetic number, because the mean of its divisors is an integer number (79866000).
Almost surely, 23311494872 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 3311494872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5111424000).
3311494872 is an abundant number, since it is smaller than the sum of its proper divisors (6911353128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3311494872 is a wasteful number, since it uses less digits than its factorization.
3311494872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23710 (or 23692 counting only the distinct ones).
The product of its digits is 145152, while the sum is 42.
The square root of 3311494872 is about 57545.5895095358. The cubic root of 3311494872 is about 1490.5321991179.
The spelling of 3311494872 in words is "three billion, three hundred eleven million, four hundred ninety-four thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •