Base | Representation |
---|---|
bin | 111101001001111001010… |
… | …011000011000111100101 |
3 | 112212202102100201122212111 |
4 | 331021321103003013211 |
5 | 1022323221320132013 |
6 | 12534335143321021 |
7 | 612423122356534 |
oct | 75117123030745 |
9 | 15782370648774 |
10 | 4202513052133 |
11 | 1380304071060 |
12 | 57a585150171 |
13 | 2463ab966bb6 |
14 | 10758d0ac31b |
15 | 744b4d8773d |
hex | 3d2794c31e5 |
4202513052133 has 16 divisors (see below), whose sum is σ = 4754243822400. Its totient is φ = 3679707185280.
The previous prime is 4202513052097. The next prime is 4202513052151. The reversal of 4202513052133 is 3312503152024.
It is a cyclic number.
It is not a de Polignac number, because 4202513052133 - 221 = 4202510954981 is a prime.
It is a super-4 number, since 4×42025130521334 (a number of 52 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4202513052095 and 4202513052104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4202513052233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15974691 + ... + 16235632.
It is an arithmetic number, because the mean of its divisors is an integer number (297140238900).
Almost surely, 24202513052133 is an apocalyptic number.
It is an amenable number.
4202513052133 is a deficient number, since it is larger than the sum of its proper divisors (551730770267).
4202513052133 is a wasteful number, since it uses less digits than its factorization.
4202513052133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32210772.
The product of its (nonzero) digits is 21600, while the sum is 31.
The spelling of 4202513052133 in words is "four trillion, two hundred two billion, five hundred thirteen million, fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •