Base | Representation |
---|---|
bin | 1010000011110011010010… |
… | …1101001000011011111001 |
3 | 1110011100220001000102100211 |
4 | 2200330310231020123321 |
5 | 2422203222302032330 |
6 | 35305031125431121 |
7 | 2221042433404543 |
oct | 240746455103371 |
9 | 43140801012324 |
10 | 11060425033465 |
11 | 358477764a9a5 |
12 | 12a7701b6b4a1 |
13 | 622cbbc49022 |
14 | 2a3482668693 |
15 | 142a913b7d2a |
hex | a0f34b486f9 |
11060425033465 has 16 divisors (see below), whose sum is σ = 13432580137872. Its totient is φ = 8741942820864.
The previous prime is 11060425033379. The next prime is 11060425033481. The reversal of 11060425033465 is 56433052406011.
11060425033465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 2973983026576 + 8086442006889 = 1724524^2 + 2843667^2 .
It is a cyclic number.
It is not a de Polignac number, because 11060425033465 - 211 = 11060425031417 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19481854 + ... + 20041543.
It is an arithmetic number, because the mean of its divisors is an integer number (839536258617).
Almost surely, 211060425033465 is an apocalyptic number.
It is an amenable number.
11060425033465 is a deficient number, since it is larger than the sum of its proper divisors (2372155104407).
11060425033465 is an equidigital number, since it uses as much as digits as its factorization.
11060425033465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39524076.
The product of its (nonzero) digits is 259200, while the sum is 40.
Adding to 11060425033465 its reverse (56433052406011), we get a palindrome (67493477439476).
The spelling of 11060425033465 in words is "eleven trillion, sixty billion, four hundred twenty-five million, thirty-three thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •