Base | Representation |
---|---|
bin | 100101000011011… |
… | …1000000101000111 |
3 | 10012122112000200011 |
4 | 1022012320011013 |
5 | 10021242112201 |
6 | 323212331051 |
7 | 42545005411 |
oct | 11206700507 |
9 | 3178460604 |
10 | 1243316551 |
11 | 588902144 |
12 | 2a8473a87 |
13 | 16a77c789 |
14 | bb1a79b1 |
15 | 74245151 |
hex | 4a1b8147 |
1243316551 has 4 divisors (see below), whose sum is σ = 1244282400. Its totient is φ = 1242350704.
The previous prime is 1243316549. The next prime is 1243316563. The reversal of 1243316551 is 1556133421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1243316551 - 21 = 1243316549 is a prime.
It is a super-3 number, since 3×12433165513 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1243316351) 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, 480991 + ... + 483568.
It is an arithmetic number, because the mean of its divisors is an integer number (311070600).
Almost surely, 21243316551 is an apocalyptic number.
1243316551 is a deficient number, since it is larger than the sum of its proper divisors (965849).
1243316551 is an equidigital number, since it uses as much as digits as its factorization.
1243316551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965848.
The product of its digits is 10800, while the sum is 31.
The square root of 1243316551 is about 35260.6941366729. The cubic root of 1243316551 is about 1075.2940391979.
Adding to 1243316551 its reverse (1556133421), we get a palindrome (2799449972).
The spelling of 1243316551 in words is "one billion, two hundred forty-three million, three hundred sixteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •