Base | Representation |
---|---|
bin | 11111110111001100… |
… | …111000101011101011 |
3 | 10021022022010211120120 |
4 | 133313030320223223 |
5 | 1030031300340243 |
6 | 23414500254323 |
7 | 2320544142642 |
oct | 376714705353 |
9 | 107268124516 |
10 | 34212121323 |
11 | 1356693a136 |
12 | 67696a13a3 |
13 | 32c2c26093 |
14 | 1927a18359 |
15 | d537eec83 |
hex | 7f7338aeb |
34212121323 has 4 divisors (see below), whose sum is σ = 45616161768. Its totient is φ = 22808080880.
The previous prime is 34212121301. The next prime is 34212121337. The reversal of 34212121323 is 32312121243.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32312121243 = 3 ⋅10770707081.
It is a cyclic number.
It is not a de Polignac number, because 34212121323 - 28 = 34212121067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34212121293 and 34212121302.
It is not an unprimeable number, because it can be changed into a prime (34212101323) 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, 5702020218 + ... + 5702020223.
It is an arithmetic number, because the mean of its divisors is an integer number (11404040442).
Almost surely, 234212121323 is an apocalyptic number.
34212121323 is a deficient number, since it is larger than the sum of its proper divisors (11404040445).
34212121323 is a wasteful number, since it uses less digits than its factorization.
34212121323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11404040444.
The product of its digits is 1728, while the sum is 24.
Adding to 34212121323 its reverse (32312121243), we get a palindrome (66524242566).
The spelling of 34212121323 in words is "thirty-four billion, two hundred twelve million, one hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •