Base | Representation |
---|---|
bin | 11111110111001100… |
… | …011101110100111001 |
3 | 10021022021221020200102 |
4 | 133313030131310321 |
5 | 1030031233330241 |
6 | 23414454045145 |
7 | 2320543204145 |
oct | 376714356471 |
9 | 107267836612 |
10 | 34212011321 |
11 | 13566874524 |
12 | 67696497b5 |
13 | 32c2bb7ca7 |
14 | 19279ca225 |
15 | d537cc39b |
hex | 7f731dd39 |
34212011321 has 4 divisors (see below), whose sum is σ = 34213689600. Its totient is φ = 34210333044.
The previous prime is 34212011299. The next prime is 34212011329. The reversal of 34212011321 is 12311021243.
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 34212011321 - 26 = 34212011257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 34212011293 and 34212011302.
It is not an unprimeable number, because it can be changed into a prime (34212011329) 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 3 ways as a sum of consecutive naturals, for example, 808181 + ... + 849458.
It is an arithmetic number, because the mean of its divisors is an integer number (8553422400).
Almost surely, 234212011321 is an apocalyptic number.
It is an amenable number.
34212011321 is a deficient number, since it is larger than the sum of its proper divisors (1678279).
34212011321 is a wasteful number, since it uses less digits than its factorization.
34212011321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678278.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 34212011321 its reverse (12311021243), we get a palindrome (46523032564).
The spelling of 34212011321 in words is "thirty-four billion, two hundred twelve million, eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •