Base | Representation |
---|---|
bin | 1111011111000001001011… |
… | …10001110101000110101101 |
3 | 11110120020221010001100102120 |
4 | 13233200211301311012231 |
5 | 13430343210420323003 |
6 | 200230513015543153 |
7 | 10113053600005413 |
oct | 757404561650655 |
9 | 143506833040376 |
10 | 34051134542253 |
11 | a9390068130a4 |
12 | 399b40808aab9 |
13 | 160001506097a |
14 | 85a12598b2b3 |
15 | 3e0b35034853 |
hex | 1ef825c751ad |
34051134542253 has 8 divisors (see below), whose sum is σ = 45544735161888. Its totient is φ = 22629145142064.
The previous prime is 34051134542231. The next prime is 34051134542329. The reversal of 34051134542253 is 35224543115043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 34051134542253 - 29 = 34051134541741 is a prime.
It is a super-2 number, since 2×340511345422532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34051134547253) 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, 17902803751 + ... + 17902805652.
It is an arithmetic number, because the mean of its divisors is an integer number (5693091895236).
Almost surely, 234051134542253 is an apocalyptic number.
It is an amenable number.
34051134542253 is a deficient number, since it is larger than the sum of its proper divisors (11493600619635).
34051134542253 is a wasteful number, since it uses less digits than its factorization.
34051134542253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35805609723.
The product of its (nonzero) digits is 864000, while the sum is 42.
Adding to 34051134542253 its reverse (35224543115043), we get a palindrome (69275677657296).
The spelling of 34051134542253 in words is "thirty-four trillion, fifty-one billion, one hundred thirty-four million, five hundred forty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •