Base | Representation |
---|---|
bin | 1011011000101010… |
… | …01011001011000101 |
3 | 120202222200000020121 |
4 | 11230111023023011 |
5 | 100004242114123 |
6 | 2450311101541 |
7 | 304321013356 |
oct | 55425131305 |
9 | 16688600217 |
10 | 6112457413 |
11 | 26573607a7 |
12 | 12270718b1 |
13 | 76548180a |
14 | 41db23d2d |
15 | 25b94d75d |
hex | 16c54b2c5 |
6112457413 has 2 divisors, whose sum is σ = 6112457414. Its totient is φ = 6112457412.
The previous prime is 6112457411. The next prime is 6112457431. The reversal of 6112457413 is 3147542116.
Together with next prime (6112457431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4694031169 + 1418426244 = 68513^2 + 37662^2 .
It is a cyclic number.
It is not a de Polignac number, because 6112457413 - 21 = 6112457411 is a prime.
Together with 6112457411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6112457411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3056228706 + 3056228707.
It is an arithmetic number, because the mean of its divisors is an integer number (3056228707).
Almost surely, 26112457413 is an apocalyptic number.
It is an amenable number.
6112457413 is a deficient number, since it is larger than the sum of its proper divisors (1).
6112457413 is an equidigital number, since it uses as much as digits as its factorization.
6112457413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20160, while the sum is 34.
The square root of 6112457413 is about 78182.2064986657. The cubic root of 6112457413 is about 1828.4030992333.
Adding to 6112457413 its reverse (3147542116), we get a palindrome (9259999529).
The spelling of 6112457413 in words is "six billion, one hundred twelve million, four hundred fifty-seven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •