Base | Representation |
---|---|
bin | 1100100011011100… |
… | …0010101110000000 |
3 | 22200212000020200120 |
4 | 3020313002232000 |
5 | 23400141403011 |
6 | 1314220020240 |
7 | 146336304312 |
oct | 31067025600 |
9 | 8625006616 |
10 | 3369872256 |
11 | 147a2289a3 |
12 | 7a0691680 |
13 | 41920796a |
14 | 23d7a77b2 |
15 | 14aca5a06 |
hex | c8dc2b80 |
3369872256 has 32 divisors (see below), whose sum is σ = 8951224200. Its totient is φ = 1123290624.
The previous prime is 3369872179. The next prime is 3369872257. The reversal of 3369872256 is 6522789633.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×33698722562 = 22712078043517059072, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3369872199 and 3369872208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3369872257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4387471 + ... + 4388238.
Almost surely, 23369872256 is an apocalyptic number.
It is an amenable number.
3369872256 is an abundant number, since it is smaller than the sum of its proper divisors (5581351944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3369872256 is an equidigital number, since it uses as much as digits as its factorization.
3369872256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8775726 (or 8775714 counting only the distinct ones).
The product of its digits is 3265920, while the sum is 51.
The square root of 3369872256 is about 58050.6008237641. The cubic root of 3369872256 is about 1499.2399491691.
The spelling of 3369872256 in words is "three billion, three hundred sixty-nine million, eight hundred seventy-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •