Base | Representation |
---|---|
bin | 1111100011101011100011… |
… | …01110001000001111010110 |
3 | 11111010120101212211012112120 |
4 | 13301311301232020033112 |
5 | 13441004242020233142 |
6 | 200432244202200410 |
7 | 10130454314412504 |
oct | 761656156101726 |
9 | 144116355735476 |
10 | 34211322430422 |
11 | a99aa38696435 |
12 | 3a064727b3106 |
13 | 1612163203a07 |
14 | 863ba040d674 |
15 | 3e4dad2377ec |
hex | 1f1d71b883d6 |
34211322430422 has 8 divisors (see below), whose sum is σ = 68422644860856. Its totient is φ = 11403774143472.
The previous prime is 34211322430403. The next prime is 34211322430457. The reversal of 34211322430422 is 22403422311243.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
34211322430422 is an admirable number.
It is a super-2 number, since 2×342113224304222 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2850943535863 + ... + 2850943535874.
It is an arithmetic number, because the mean of its divisors is an integer number (8552830607607).
Almost surely, 234211322430422 is an apocalyptic number.
34211322430422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34211322430422 is a wasteful number, since it uses less digits than its factorization.
34211322430422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5701887071742.
The product of its (nonzero) digits is 55296, while the sum is 33.
Adding to 34211322430422 its reverse (22403422311243), we get a palindrome (56614744741665).
The spelling of 34211322430422 in words is "thirty-four trillion, two hundred eleven billion, three hundred twenty-two million, four hundred thirty thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •