Base | Representation |
---|---|
bin | 101000000111101… |
… | …1111111110101010 |
3 | 10110211012002200112 |
4 | 1100033133332222 |
5 | 10224114143201 |
6 | 341330334322 |
7 | 45234566126 |
oct | 12017377652 |
9 | 3424162615 |
10 | 1346240426 |
11 | 630a103a3 |
12 | 316a2a3a2 |
13 | 185ba808b |
14 | cab1a586 |
15 | 7d2c60bb |
hex | 503dffaa |
1346240426 has 8 divisors (see below), whose sum is σ = 2021730564. Its totient is φ = 672330240.
The previous prime is 1346240369. The next prime is 1346240429. The reversal of 1346240426 is 6240426431.
It can be written as a sum of positive squares in 2 ways, for example, as 1287733225 + 58507201 = 35885^2 + 7649^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13462404262 = 3624726569193322952, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1346240392 and 1346240401.
It is not an unprimeable number, because it can be changed into a prime (1346240429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 392855 + ... + 396266.
Almost surely, 21346240426 is an apocalyptic number.
1346240426 is a deficient number, since it is larger than the sum of its proper divisors (675490138).
1346240426 is an equidigital number, since it uses as much as digits as its factorization.
1346240426 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789976.
The product of its (nonzero) digits is 27648, while the sum is 32.
The square root of 1346240426 is about 36691.1491507148. The cubic root of 1346240426 is about 1104.1825409890.
Adding to 1346240426 its reverse (6240426431), we get a palindrome (7586666857).
The spelling of 1346240426 in words is "one billion, three hundred forty-six million, two hundred forty thousand, four hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •