Base | Representation |
---|---|
bin | 1010000110010011000111… |
… | …1111111000100110011000 |
3 | 1110022110122002221111202011 |
4 | 2201210301333320212120 |
5 | 2423404104244300043 |
6 | 35340444332515304 |
7 | 2224121564516500 |
oct | 241446177704630 |
9 | 43273562844664 |
10 | 11103329290648 |
11 | 35a0993a15391 |
12 | 12b3a9661bb34 |
13 | 6270688ccc5a |
14 | 2a5592838a00 |
15 | 143c52d3059d |
hex | a1931ff8998 |
11103329290648 has 48 divisors (see below), whose sum is σ = 24808396926600. Its totient is φ = 4642507013760.
The previous prime is 11103329290643. The next prime is 11103329290667. The reversal of 11103329290648 is 84609292330111.
11103329290648 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×111033292906483 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103329290643) 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, 345408558 + ... + 345440701.
Almost surely, 211103329290648 is an apocalyptic number.
It is an amenable number.
11103329290648 is an abundant number, since it is smaller than the sum of its proper divisors (13705067635952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11103329290648 is a wasteful number, since it uses less digits than its factorization.
11103329290648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 690849320 (or 690849309 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 49.
The spelling of 11103329290648 in words is "eleven trillion, one hundred three billion, three hundred twenty-nine million, two hundred ninety thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •