Base | Representation |
---|---|
bin | 1100101001111110… |
… | …1000111101100000 |
3 | 22202202121022022220 |
4 | 3022133220331200 |
5 | 23424201314442 |
6 | 1321035431040 |
7 | 150121335012 |
oct | 31237507540 |
9 | 8682538286 |
10 | 3397291872 |
11 | 1493756737 |
12 | 7a98b5480 |
13 | 421ab82a0 |
14 | 2432a41b2 |
15 | 14d3beeec |
hex | ca7e8f60 |
3397291872 has 48 divisors (see below), whose sum is σ = 9603886320. Its totient is φ = 1045320192.
The previous prime is 3397291861. The next prime is 3397291873. The reversal of 3397291872 is 2781927933.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3397291873) by changing a digit.
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, 1359847 + ... + 1362342.
It is an arithmetic number, because the mean of its divisors is an integer number (200080965).
Almost surely, 23397291872 is an apocalyptic number.
3397291872 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3397291872 is an abundant number, since it is smaller than the sum of its proper divisors (6206594448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3397291872 is a wasteful number, since it uses less digits than its factorization.
3397291872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2722215 (or 2722207 counting only the distinct ones).
The product of its digits is 1143072, while the sum is 51.
The square root of 3397291872 is about 58286.2923164615. The cubic root of 3397291872 is about 1503.2952551170.
The spelling of 3397291872 in words is "three billion, three hundred ninety-seven million, two hundred ninety-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •