Base | Representation |
---|---|
bin | 100100100000001… |
… | …011001101110011 |
3 | 1120200100212111222 |
4 | 210200023031303 |
5 | 2223234224243 |
6 | 140434055255 |
7 | 21114302333 |
oct | 4440131563 |
9 | 1520325458 |
10 | 612414323 |
11 | 294767a44 |
12 | 15111a52b |
13 | 99b54351 |
14 | 5b4990c3 |
15 | 38b71168 |
hex | 2480b373 |
612414323 has 4 divisors (see below), whose sum is σ = 612464448. Its totient is φ = 612364200.
The previous prime is 612414233. The next prime is 612414329. The reversal of 612414323 is 323414216.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-612414323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 612414292 and 612414301.
It is not an unprimeable number, because it can be changed into a prime (612414329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6590 + ... + 35612.
It is an arithmetic number, because the mean of its divisors is an integer number (153116112).
Almost surely, 2612414323 is an apocalyptic number.
612414323 is a deficient number, since it is larger than the sum of its proper divisors (50125).
612414323 is a wasteful number, since it uses less digits than its factorization.
612414323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50124.
The product of its digits is 3456, while the sum is 26.
The square root of 612414323 is about 24747.0063442025. The cubic root of 612414323 is about 849.2100263641.
Adding to 612414323 its reverse (323414216), we get a palindrome (935828539).
The spelling of 612414323 in words is "six hundred twelve million, four hundred fourteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •