Base | Representation |
---|---|
bin | 101100011011110100110… |
… | …100111111111001000011 |
3 | 101210220201001112012111101 |
4 | 230123310310333321003 |
5 | 400012114241022201 |
6 | 10254435125355231 |
7 | 433416266263324 |
oct | 54336464777103 |
9 | 11726631465441 |
10 | 3053534314051 |
11 | a77aa6573231 |
12 | 413966568b17 |
13 | 191c40891a00 |
14 | a7b12b9844b |
15 | 54669522d01 |
hex | 2c6f4d3fe43 |
3053534314051 has 12 divisors (see below), whose sum is σ = 3323274067872. Its totient is φ = 2804339175456.
The previous prime is 3053534313997. The next prime is 3053534314069. The reversal of 3053534314051 is 1504134353503.
It is not a de Polignac number, because 3053534314051 - 219 = 3053533789763 is a prime.
It is a super-2 number, since 2×30535343140512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3053534314051.
It is not an unprimeable number, because it can be changed into a prime (3053534314091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45825211 + ... + 45891796.
It is an arithmetic number, because the mean of its divisors is an integer number (276939505656).
Almost surely, 23053534314051 is an apocalyptic number.
3053534314051 is a deficient number, since it is larger than the sum of its proper divisors (269739753821).
3053534314051 is a wasteful number, since it uses less digits than its factorization.
3053534314051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91717230 (or 91717217 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 3053534314051 its reverse (1504134353503), we get a palindrome (4557668667554).
The spelling of 3053534314051 in words is "three trillion, fifty-three billion, five hundred thirty-four million, three hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •