Base | Representation |
---|---|
bin | 1010010000110110101011… |
… | …1100010000001100111101 |
3 | 1110221210201021121222020222 |
4 | 2210031222330100030331 |
5 | 2434342002324011433 |
6 | 40000035103351125 |
7 | 2243201503054514 |
oct | 244155274201475 |
9 | 43853637558228 |
10 | 11284673266493 |
11 | 3660891960500 |
12 | 13230662b24a5 |
13 | 63b1a8b08883 |
14 | 2b0276d2167b |
15 | 148818513b98 |
hex | a436af1033d |
11284673266493 has 12 divisors (see below), whose sum is σ = 12607155645084. Its totient is φ = 10090616923200.
The previous prime is 11284673266483. The next prime is 11284673266511. The reversal of 11284673266493 is 39466237648211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 451082827129 + 10833590439364 = 671627^2 + 3291442^2 .
It is not a de Polignac number, because 11284673266493 - 26 = 11284673266429 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11284673266483) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 764433296 + ... + 764448057.
It is an arithmetic number, because the mean of its divisors is an integer number (1050596303757).
Almost surely, 211284673266493 is an apocalyptic number.
It is an amenable number.
11284673266493 is a deficient number, since it is larger than the sum of its proper divisors (1322482378591).
11284673266493 is a wasteful number, since it uses less digits than its factorization.
11284673266493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1528881436 (or 1528881425 counting only the distinct ones).
The product of its digits is 62705664, while the sum is 62.
The spelling of 11284673266493 in words is "eleven trillion, two hundred eighty-four billion, six hundred seventy-three million, two hundred sixty-six thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •