Base | Representation |
---|---|
bin | 1001100101101000110011… |
… | …0001011101011111011001 |
3 | 1101022211021211212101100001 |
4 | 2121122030301131133121 |
5 | 2340210422122123343 |
6 | 34231005231413001 |
7 | 2135435554255213 |
oct | 231321461353731 |
9 | 41284254771301 |
10 | 10542211520473 |
11 | 33a4a21628626 |
12 | 1223199384161 |
13 | 5b6184591b39 |
14 | 2863625195b3 |
15 | 1343617a344d |
hex | 9968cc5d7d9 |
10542211520473 has 2 divisors, whose sum is σ = 10542211520474. Its totient is φ = 10542211520472.
The previous prime is 10542211520459. The next prime is 10542211520551. The reversal of 10542211520473 is 37402511224501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6883208746569 + 3659002773904 = 2623587^2 + 1912852^2 .
It is a cyclic number.
It is not a de Polignac number, because 10542211520473 - 25 = 10542211520441 is a prime.
It is a super-2 number, since 2×105422115204732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10542211520453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5271105760236 + 5271105760237.
It is an arithmetic number, because the mean of its divisors is an integer number (5271105760237).
Almost surely, 210542211520473 is an apocalyptic number.
It is an amenable number.
10542211520473 is a deficient number, since it is larger than the sum of its proper divisors (1).
10542211520473 is an equidigital number, since it uses as much as digits as its factorization.
10542211520473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 67200, while the sum is 37.
Adding to 10542211520473 its reverse (37402511224501), we get a palindrome (47944722744974).
The spelling of 10542211520473 in words is "ten trillion, five hundred forty-two billion, two hundred eleven million, five hundred twenty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •