Base | Representation |
---|---|
bin | 10111000000110111… |
… | …00100010011101101 |
3 | 1011220001121010010122 |
4 | 23200123210103231 |
5 | 200300421220311 |
6 | 5402000014325 |
7 | 615113646062 |
oct | 134033442355 |
9 | 34801533118 |
10 | 12355257581 |
11 | 5270247987 |
12 | 24899013a5 |
13 | 121b93bb04 |
14 | 852c96c69 |
15 | 4c4a470db |
hex | 2e06e44ed |
12355257581 has 2 divisors, whose sum is σ = 12355257582. Its totient is φ = 12355257580.
The previous prime is 12355257559. The next prime is 12355257617. The reversal of 12355257581 is 18575255321.
12355257581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11228581225 + 1126676356 = 105965^2 + 33566^2 .
It is a cyclic number.
It is not a de Polignac number, because 12355257581 - 218 = 12354995437 is a prime.
It is a super-2 number, since 2×123552575812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12355257511) 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 as a sum of consecutive naturals, namely, 6177628790 + 6177628791.
It is an arithmetic number, because the mean of its divisors is an integer number (6177628791).
Almost surely, 212355257581 is an apocalyptic number.
It is an amenable number.
12355257581 is a deficient number, since it is larger than the sum of its proper divisors (1).
12355257581 is an equidigital number, since it uses as much as digits as its factorization.
12355257581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 420000, while the sum is 44.
The spelling of 12355257581 in words is "twelve billion, three hundred fifty-five million, two hundred fifty-seven thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •