Base | Representation |
---|---|
bin | 111101111000001100111… |
… | …010101011111101011101 |
3 | 120001111202112002111011012 |
4 | 331320030322223331131 |
5 | 1024132033442142140 |
6 | 13013241031105005 |
7 | 616133221321235 |
oct | 75701472537535 |
9 | 16044675074135 |
10 | 4252234334045 |
11 | 139a3a9476085 |
12 | 588140812165 |
13 | 24aca3a4a879 |
14 | 109b487a8cc5 |
15 | 75925024265 |
hex | 3de0ceabf5d |
4252234334045 has 8 divisors (see below), whose sum is σ = 5371243369440. Its totient is φ = 3222746021520.
The previous prime is 4252234334011. The next prime is 4252234334053. The reversal of 4252234334045 is 5404334322524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4252234334045 - 226 = 4252167225181 is a prime.
It is a super-2 number, since 2×42522343340452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4252234333993 and 4252234334011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22380180611 + ... + 22380180800.
It is an arithmetic number, because the mean of its divisors is an integer number (671405421180).
Almost surely, 24252234334045 is an apocalyptic number.
It is an amenable number.
4252234334045 is a deficient number, since it is larger than the sum of its proper divisors (1119009035395).
4252234334045 is a wasteful number, since it uses less digits than its factorization.
4252234334045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44760361435.
The product of its (nonzero) digits is 1382400, while the sum is 41.
Adding to 4252234334045 its reverse (5404334322524), we get a palindrome (9656568656569).
The spelling of 4252234334045 in words is "four trillion, two hundred fifty-two billion, two hundred thirty-four million, three hundred thirty-four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •