Base | Representation |
---|---|
bin | 1011001001010110110011… |
… | …0000100001100100010101 |
3 | 1121101121020112221001100210 |
4 | 2302111230300201210111 |
5 | 3101242442241331341 |
6 | 42022012041200033 |
7 | 2403264255142533 |
oct | 262255460414425 |
9 | 47347215831323 |
10 | 12255366355221 |
11 | 39a55208a1170 |
12 | 145b209490019 |
13 | 6ab8a349b9a2 |
14 | 30523cdb9153 |
15 | 163bcbe0ac16 |
hex | b256cc21915 |
12255366355221 has 32 divisors (see below), whose sum is σ = 18548759420928. Its totient is φ = 7132303231040.
The previous prime is 12255366355201. The next prime is 12255366355223.
It is a happy number.
12255366355221 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 12255366355221 - 217 = 12255366224149 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12255366355223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74461101 + ... + 74625506.
It is an arithmetic number, because the mean of its divisors is an integer number (579648731904).
Almost surely, 212255366355221 is an apocalyptic number.
12255366355221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12255366355221 is a deficient number, since it is larger than the sum of its proper divisors (6293393065707).
12255366355221 is a wasteful number, since it uses less digits than its factorization.
12255366355221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149086721.
The product of its digits is 3240000, while the sum is 48.
The spelling of 12255366355221 in words is "twelve trillion, two hundred fifty-five billion, three hundred sixty-six million, three hundred fifty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •