Base | Representation |
---|---|
bin | 111010111110001001000… |
… | …011000010001110001101 |
3 | 112100102002110002020122022 |
4 | 322332021003002032031 |
5 | 1012343411034344003 |
6 | 12341401005055525 |
7 | 565531400562320 |
oct | 72761103021615 |
9 | 15312073066568 |
10 | 4052453434253 |
11 | 13226aa353134 |
12 | 5554865575a5 |
13 | 2351b5c426b3 |
14 | 1001d583c7b7 |
15 | 70630e2d738 |
hex | 3af890c238d |
4052453434253 has 8 divisors (see below), whose sum is σ = 4642121007360. Its totient is φ = 3465472274640.
The previous prime is 4052453434223. The next prime is 4052453434291. The reversal of 4052453434253 is 3524343542504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4052453434253 - 26 = 4052453434189 is a prime.
It is a super-3 number, since 3×40524534342533 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4052453434223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 671600138 + ... + 671606171.
It is an arithmetic number, because the mean of its divisors is an integer number (580265125920).
Almost surely, 24052453434253 is an apocalyptic number.
It is an amenable number.
4052453434253 is a deficient number, since it is larger than the sum of its proper divisors (589667573107).
4052453434253 is a wasteful number, since it uses less digits than its factorization.
4052453434253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1343206747.
The product of its (nonzero) digits is 3456000, while the sum is 44.
Adding to 4052453434253 its reverse (3524343542504), we get a palindrome (7576796976757).
The spelling of 4052453434253 in words is "four trillion, fifty-two billion, four hundred fifty-three million, four hundred thirty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •