Base | Representation |
---|---|
bin | 1111100001000101001100… |
… | …11011011111101100111101 |
3 | 11110211000212201021212001202 |
4 | 13300202212123133230331 |
5 | 13433023340140100041 |
6 | 200323234110545245 |
7 | 10121143164036143 |
oct | 760424633375475 |
9 | 143730781255052 |
10 | 34122012425021 |
11 | a966078500514 |
12 | 39b10a8b08225 |
13 | 16068cc329981 |
14 | 85d72b003593 |
15 | 3e28d2753a9b |
hex | 1f08a66dfb3d |
34122012425021 has 4 divisors (see below), whose sum is σ = 34128054933312. Its totient is φ = 34115969916732.
The previous prime is 34122012424931. The next prime is 34122012425027. The reversal of 34122012425021 is 12052421022143.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 34122012425021 - 210 = 34122012423997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34122012425027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3021245675 + ... + 3021256968.
It is an arithmetic number, because the mean of its divisors is an integer number (8532013733328).
Almost surely, 234122012425021 is an apocalyptic number.
It is an amenable number.
34122012425021 is a deficient number, since it is larger than the sum of its proper divisors (6042508291).
34122012425021 is an equidigital number, since it uses as much as digits as its factorization.
34122012425021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6042508290.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 34122012425021 its reverse (12052421022143), we get a palindrome (46174433447164).
The spelling of 34122012425021 in words is "thirty-four trillion, one hundred twenty-two billion, twelve million, four hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •