Base | Representation |
---|---|
bin | 111101100111010101111… |
… | …000000010000011100101 |
3 | 112222210000212111221201110 |
4 | 331213111320002003211 |
5 | 1023333000020201203 |
6 | 13001044414215233 |
7 | 614622466601052 |
oct | 75472570020345 |
9 | 15883025457643 |
10 | 4234131022053 |
11 | 139275963a909 |
12 | 584729ab4519 |
13 | 24937a2b713a |
14 | 108d0c368029 |
15 | 75215a5ed03 |
hex | 3d9d5e020e5 |
4234131022053 has 64 divisors (see below), whose sum is σ = 6160747507200. Its totient is φ = 2575831744512.
The previous prime is 4234131022039. The next prime is 4234131022061. The reversal of 4234131022053 is 3502201314324.
4234131022053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4234131022053 - 29 = 4234131021541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4234131022053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4234131022003) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 670272451 + ... + 670278767.
It is an arithmetic number, because the mean of its divisors is an integer number (96261679800).
Almost surely, 24234131022053 is an apocalyptic number.
It is an amenable number.
4234131022053 is a deficient number, since it is larger than the sum of its proper divisors (1926616485147).
4234131022053 is a wasteful number, since it uses less digits than its factorization.
4234131022053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7566.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 4234131022053 its reverse (3502201314324), we get a palindrome (7736332336377).
The spelling of 4234131022053 in words is "four trillion, two hundred thirty-four billion, one hundred thirty-one million, twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •