Base | Representation |
---|---|
bin | 1010010010000111111001… |
… | …0100100100011111101100 |
3 | 1111000212222120010121100110 |
4 | 2210201332110210133230 |
5 | 2440221124122312102 |
6 | 40014042212500020 |
7 | 2244602642605245 |
oct | 244417624443754 |
9 | 44025876117313 |
10 | 11306473244652 |
11 | 366a059429783 |
12 | 132732b01a610 |
13 | 640271396631 |
14 | 2b13442b5ccc |
15 | 1491922d186c |
hex | a487e5247ec |
11306473244652 has 48 divisors (see below), whose sum is σ = 26397067961600. Its totient is φ = 3766639631040.
The previous prime is 11306473244623. The next prime is 11306473244659. The reversal of 11306473244652 is 25644237460311.
11306473244652 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-2 number, since 2×113064732446522 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11306473244659) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 209511249 + ... + 209565207.
Almost surely, 211306473244652 is an apocalyptic number.
11306473244652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11306473244652 is an abundant number, since it is smaller than the sum of its proper divisors (15090594716948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11306473244652 is a wasteful number, since it uses less digits than its factorization.
11306473244652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63766 (or 63764 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 48.
The spelling of 11306473244652 in words is "eleven trillion, three hundred six billion, four hundred seventy-three million, two hundred forty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •