Base | Representation |
---|---|
bin | 1010011101001111001011… |
… | …0110101110100001000000 |
3 | 1111201010211001112002221200 |
4 | 2213103302312232201000 |
5 | 3001333142132313142 |
6 | 40241500312021200 |
7 | 2264442314210205 |
oct | 247236266564100 |
9 | 44633731462850 |
10 | 11497406916672 |
11 | 3733028516536 |
12 | 1358336391800 |
13 | 65527c2811a1 |
14 | 2ba698237cac |
15 | 14e11982664c |
hex | a74f2dae840 |
11497406916672 has 42 divisors (see below), whose sum is σ = 32955241007598. Its totient is φ = 3832468972032.
The previous prime is 11497406916629. The next prime is 11497406916683. The reversal of 11497406916672 is 27661960479411.
11497406916672 is a `hidden beast` number, since 1 + 1 + 497 + 4 + 0 + 69 + 16 + 6 + 72 = 666.
It can be written as a sum of positive squares in only one way, i.e., 8259048308736 + 3238358607936 = 2873856^2 + 1799544^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9980387373 + ... + 9980388524.
It is an arithmetic number, because the mean of its divisors is an integer number (784648595419).
Almost surely, 211497406916672 is an apocalyptic number.
11497406916672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11497406916672 is an abundant number, since it is smaller than the sum of its proper divisors (21457834090926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11497406916672 is a wasteful number, since it uses less digits than its factorization.
11497406916672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19960775915 (or 19960775902 counting only the distinct ones).
The product of its (nonzero) digits is 27433728, while the sum is 63.
The spelling of 11497406916672 in words is "eleven trillion, four hundred ninety-seven billion, four hundred six million, nine hundred sixteen thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •