Base | Representation |
---|---|
bin | 1010011011001100110010… |
… | …1010011011101000011101 |
3 | 1111120210110210220201002221 |
4 | 2212303030222123220131 |
5 | 3000300002020433041 |
6 | 40213431245545341 |
7 | 2262063055000633 |
oct | 246631452335035 |
9 | 44523423821087 |
10 | 11462406421021 |
11 | 371a1a7667076 |
12 | 13515a8875251 |
13 | 651b91c15a2a |
14 | 2b8ad7a3d353 |
15 | 14d26bbe92d1 |
hex | a6ccca9ba1d |
11462406421021 has 2 divisors, whose sum is σ = 11462406421022. Its totient is φ = 11462406421020.
The previous prime is 11462406421001. The next prime is 11462406421057. The reversal of 11462406421021 is 12012460426411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7672041324025 + 3790365096996 = 2769845^2 + 1946886^2 .
It is a cyclic number.
It is not a de Polignac number, because 11462406421021 - 227 = 11462272203293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11462406421001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5731203210510 + 5731203210511.
It is an arithmetic number, because the mean of its divisors is an integer number (5731203210511).
Almost surely, 211462406421021 is an apocalyptic number.
It is an amenable number.
11462406421021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11462406421021 is an equidigital number, since it uses as much as digits as its factorization.
11462406421021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 34.
Adding to 11462406421021 its reverse (12012460426411), we get a palindrome (23474866847432).
The spelling of 11462406421021 in words is "eleven trillion, four hundred sixty-two billion, four hundred six million, four hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •