Base | Representation |
---|---|
bin | 10111011000101000… |
… | …10011100000011111 |
3 | 1012101221211211202011 |
4 | 23230110103200133 |
5 | 201202444232401 |
6 | 5433442212051 |
7 | 623055010423 |
oct | 135424234037 |
9 | 35357754664 |
10 | 12554680351 |
11 | 5362876194 |
12 | 2524654027 |
13 | 1251053455 |
14 | 871568b83 |
15 | 4d72da451 |
hex | 2ec51381f |
12554680351 has 4 divisors (see below), whose sum is σ = 12576668104. Its totient is φ = 12532692600.
The previous prime is 12554680343. The next prime is 12554680361. The reversal of 12554680351 is 15308645521.
12554680351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15308645521 = 13 ⋅1177588117.
It is a cyclic number.
It is not a de Polignac number, because 12554680351 - 23 = 12554680343 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 (12554680361) 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 3 ways as a sum of consecutive naturals, for example, 10993020 + ... + 10994161.
It is an arithmetic number, because the mean of its divisors is an integer number (3144167026).
Almost surely, 212554680351 is an apocalyptic number.
12554680351 is a deficient number, since it is larger than the sum of its proper divisors (21987753).
12554680351 is an equidigital number, since it uses as much as digits as its factorization.
12554680351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21987752.
The product of its (nonzero) digits is 144000, while the sum is 40.
The spelling of 12554680351 in words is "twelve billion, five hundred fifty-four million, six hundred eighty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •