Base | Representation |
---|---|
bin | 111101001100011111101… |
… | …001110111100100100000 |
3 | 112220000121212111010220221 |
4 | 331030133221313210200 |
5 | 1022344430314131000 |
6 | 12535520124212424 |
7 | 612552232441432 |
oct | 75143751674440 |
9 | 15800555433827 |
10 | 4205304052000 |
11 | 1381506561617 |
12 | 57b02399a114 |
13 | 246734c626cc |
14 | 107775a2c652 |
15 | 745c9de561a |
hex | 3d31fa77920 |
4205304052000 has 48 divisors (see below), whose sum is σ = 10332432065592. Its totient is φ = 1682121619200.
The previous prime is 4205304051967. The next prime is 4205304052031. The reversal of 4205304052000 is 2504035024.
It can be written as a sum of positive squares in 4 ways, for example, as 435446893456 + 3769857158544 = 659884^2 + 1941612^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 525659007 + ... + 525667006.
Almost surely, 24205304052000 is an apocalyptic number.
4205304052000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4205304052000 is an abundant number, since it is smaller than the sum of its proper divisors (6127128013592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4205304052000 is a wasteful number, since it uses less digits than its factorization.
4205304052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051326038 (or 1051326020 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 25.
Adding to 4205304052000 its reverse (2504035024), we get a palindrome (4207808087024).
The spelling of 4205304052000 in words is "four trillion, two hundred five billion, three hundred four million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •