Base | Representation |
---|---|
bin | 10111011000001100… |
… | …11000111000010111 |
3 | 1012101200222111121202 |
4 | 23230012120320113 |
5 | 201201031013333 |
6 | 5433232103115 |
7 | 623012005013 |
oct | 135406307027 |
9 | 35350874552 |
10 | 12551032343 |
11 | 5360804403 |
12 | 2523394a9b |
13 | 1250376b75 |
14 | 870c99543 |
15 | 4d6d195e8 |
hex | 2ec198e17 |
12551032343 has 8 divisors (see below), whose sum is σ = 12790240848. Its totient is φ = 12311912704.
The previous prime is 12551032283. The next prime is 12551032399. The reversal of 12551032343 is 34323015521.
It is a happy number.
12551032343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12551032343 - 214 = 12551015959 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 (12551034343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309671 + ... + 347847.
It is an arithmetic number, because the mean of its divisors is an integer number (1598780106).
Almost surely, 212551032343 is an apocalyptic number.
12551032343 is a deficient number, since it is larger than the sum of its proper divisors (239208505).
12551032343 is an equidigital number, since it uses as much as digits as its factorization.
12551032343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44433.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 12551032343 its reverse (34323015521), we get a palindrome (46874047864).
The spelling of 12551032343 in words is "twelve billion, five hundred fifty-one million, thirty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •