Base | Representation |
---|---|
bin | 100101000011100… |
… | …0000100100110111 |
3 | 10012122120210102001 |
4 | 1022013000210313 |
5 | 10021244220401 |
6 | 323213200131 |
7 | 42545212024 |
oct | 11207004467 |
9 | 3178523361 |
10 | 1243351351 |
11 | 588926300 |
12 | 2a8490047 |
13 | 16a792578 |
14 | bb1b654b |
15 | 74250601 |
hex | 4a1c0937 |
1243351351 has 12 divisors (see below), whose sum is σ = 1372010976. Its totient is φ = 1125893120.
The previous prime is 1243351331. The next prime is 1243351381. The reversal of 1243351351 is 1531533421.
It is a happy number.
It is not a de Polignac number, because 1243351351 - 27 = 1243351223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1243351331) 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 11 ways as a sum of consecutive naturals, for example, 11106 + ... + 51088.
It is an arithmetic number, because the mean of its divisors is an integer number (114334248).
Almost surely, 21243351351 is an apocalyptic number.
1243351351 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1243351351 is a deficient number, since it is larger than the sum of its proper divisors (128659625).
1243351351 is a wasteful number, since it uses less digits than its factorization.
1243351351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40262 (or 40251 counting only the distinct ones).
The product of its digits is 5400, while the sum is 28.
The square root of 1243351351 is about 35261.1876005333. The cubic root of 1243351351 is about 1075.3040714736.
Adding to 1243351351 its reverse (1531533421), we get a palindrome (2774884772).
The spelling of 1243351351 in words is "one billion, two hundred forty-three million, three hundred fifty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •