Base | Representation |
---|---|
bin | 1010100100101010111100… |
… | …1101100001111000101011 |
3 | 1112011100110200012221001202 |
4 | 2221022233031201320223 |
5 | 3010431221442444233 |
6 | 40420301253234415 |
7 | 2306613223430420 |
oct | 251125715417053 |
9 | 45140420187052 |
10 | 11625121062443 |
11 | 3782205856539 |
12 | 1379039632a0b |
13 | 6643236c4445 |
14 | 2c2931cb7d47 |
15 | 1525e1b5ebe8 |
hex | a92af361e2b |
11625121062443 has 4 divisors (see below), whose sum is σ = 13285852642800. Its totient is φ = 9964389482088.
The previous prime is 11625121062437. The next prime is 11625121062473. The reversal of 11625121062443 is 34426012152611.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11625121062443 - 240 = 10525609434667 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11625121062397 and 11625121062406.
It is not an unprimeable number, because it can be changed into a prime (11625121062473) 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 in 3 ways as a sum of consecutive naturals, for example, 830365790168 + ... + 830365790181.
It is an arithmetic number, because the mean of its divisors is an integer number (3321463160700).
Almost surely, 211625121062443 is an apocalyptic number.
11625121062443 is a deficient number, since it is larger than the sum of its proper divisors (1660731580357).
11625121062443 is an equidigital number, since it uses as much as digits as its factorization.
11625121062443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1660731580356.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 11625121062443 in words is "eleven trillion, six hundred twenty-five billion, one hundred twenty-one million, sixty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •