Base | Representation |
---|---|
bin | 10100100011101001001… |
… | …010011011111111101011 |
3 | 12000001022210002100020212 |
4 | 110203221022123333223 |
5 | 141121112220204043 |
6 | 3000544554011335 |
7 | 204030026142401 |
oct | 24435112337753 |
9 | 5001283070225 |
10 | 1412661100523 |
11 | 4a51193aa532 |
12 | 1a9949416b4b |
13 | a32a0a0b12a |
14 | 4c531d57471 |
15 | 26b2e96c018 |
hex | 148e929bfeb |
1412661100523 has 2 divisors, whose sum is σ = 1412661100524. Its totient is φ = 1412661100522.
The previous prime is 1412661100493. The next prime is 1412661100531. The reversal of 1412661100523 is 3250011662141.
It is a strong prime.
It is an emirp because it is prime and its reverse (3250011662141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1412661100523 - 226 = 1412593991659 is a prime.
It is a super-2 number, since 2×14126611005232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1412661100523.
It is not a weakly prime, because it can be changed into another prime (1412661103523) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706330550261 + 706330550262.
It is an arithmetic number, because the mean of its divisors is an integer number (706330550262).
Almost surely, 21412661100523 is an apocalyptic number.
1412661100523 is a deficient number, since it is larger than the sum of its proper divisors (1).
1412661100523 is an equidigital number, since it uses as much as digits as its factorization.
1412661100523 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 1412661100523 its reverse (3250011662141), we get a palindrome (4662672762664).
The spelling of 1412661100523 in words is "one trillion, four hundred twelve billion, six hundred sixty-one million, one hundred thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •