Base | Representation |
---|---|
bin | 100111110000111… |
… | …0000101110111111 |
3 | 10102222121221111122 |
4 | 1033201300232333 |
5 | 10213032003211 |
6 | 340221341155 |
7 | 45030640643 |
oct | 11741605677 |
9 | 3388557448 |
10 | 1334250431 |
11 | 625171108 |
12 | 312a077bb |
13 | 18356a7c7 |
14 | c92b8c23 |
15 | 7c2086db |
hex | 4f870bbf |
1334250431 has 2 divisors, whose sum is σ = 1334250432. Its totient is φ = 1334250430.
The previous prime is 1334250391. The next prime is 1334250479. The reversal of 1334250431 is 1340524331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1334250431 - 218 = 1333988287 is a prime.
It is a super-2 number, since 2×13342504312 = 3560448425247371522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1334250431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1334250031) 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 as a sum of consecutive naturals, namely, 667125215 + 667125216.
It is an arithmetic number, because the mean of its divisors is an integer number (667125216).
Almost surely, 21334250431 is an apocalyptic number.
1334250431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1334250431 is an equidigital number, since it uses as much as digits as its factorization.
1334250431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 1334250431 is about 36527.3928853402. The cubic root of 1334250431 is about 1100.8947076111.
Adding to 1334250431 its reverse (1340524331), we get a palindrome (2674774762).
The spelling of 1334250431 in words is "one billion, three hundred thirty-four million, two hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •