Base | Representation |
---|---|
bin | 1111011110100001011000… |
… | …01001000111110000001111 |
3 | 11110111121212020222222220111 |
4 | 13233100230021013300033 |
5 | 13430103224212121223 |
6 | 200215010524100451 |
7 | 10111610525026204 |
oct | 757205411076017 |
9 | 143447766888814 |
10 | 34034061442063 |
11 | a931845466241 |
12 | 3998042394727 |
13 | 15cb523b84917 |
14 | 8593862bdcab |
15 | 3e048621d30d |
hex | 1ef42c247c0f |
34034061442063 has 8 divisors (see below), whose sum is σ = 36059061935232. Its totient is φ = 32011616157696.
The previous prime is 34034061442057. The next prime is 34034061442079. The reversal of 34034061442063 is 36024416043043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34034061442063 is a prime.
It is a super-2 number, since 2×340340614420632 (a number of 28 digits) contains 22 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 (34034061442013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 638774770 + ... + 638828047.
It is an arithmetic number, because the mean of its divisors is an integer number (4507382741904).
Almost surely, 234034061442063 is an apocalyptic number.
34034061442063 is a deficient number, since it is larger than the sum of its proper divisors (2025000493169).
34034061442063 is a wasteful number, since it uses less digits than its factorization.
34034061442063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1277604401.
The product of its (nonzero) digits is 497664, while the sum is 40.
The spelling of 34034061442063 in words is "thirty-four trillion, thirty-four billion, sixty-one million, four hundred forty-two thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •