Base | Representation |
---|---|
bin | 1011000110010000010111… |
… | …0101100000011100001001 |
3 | 1121012111202022212212102221 |
4 | 2301210011311200130021 |
5 | 3044404400100004041 |
6 | 41541322314254041 |
7 | 2366400261455014 |
oct | 261440565403411 |
9 | 47174668785387 |
10 | 12202100000521 |
11 | 3984977384522 |
12 | 1450a22727321 |
13 | 6a6864ac9c02 |
14 | 30282894a37b |
15 | 16261090c2d1 |
hex | b1905d60709 |
12202100000521 has 2 divisors, whose sum is σ = 12202100000522. Its totient is φ = 12202100000520.
The previous prime is 12202100000513. The next prime is 12202100000543. The reversal of 12202100000521 is 12500000120221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9428209750521 + 2773890250000 = 3070539^2 + 1665500^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202100000521 - 23 = 12202100000513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12202100000495 and 12202100000504.
It is not a weakly prime, because it can be changed into another prime (12202100000551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101050000260 + 6101050000261.
It is an arithmetic number, because the mean of its divisors is an integer number (6101050000261).
Almost surely, 212202100000521 is an apocalyptic number.
It is an amenable number.
12202100000521 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202100000521 is an equidigital number, since it uses as much as digits as its factorization.
12202100000521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 12202100000521 its reverse (12500000120221), we get a palindrome (24702100120742).
The spelling of 12202100000521 in words is "twelve trillion, two hundred two billion, one hundred million, five hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •