Base | Representation |
---|---|
bin | 1010000011011100010011… |
… | …1010111111111001110010 |
3 | 1110010202222000100121200120 |
4 | 2200313010322333321302 |
5 | 2422103103142344132 |
6 | 35302130545031110 |
7 | 2220433510134336 |
oct | 240670472777162 |
9 | 43122860317616 |
10 | 11054254653042 |
11 | 35820a0627847 |
12 | 12a647b625496 |
13 | 622547796a53 |
14 | 2a3058d877c6 |
15 | 14282e82702c |
hex | a0dc4ebfe72 |
11054254653042 has 48 divisors (see below), whose sum is σ = 22289913489312. Its totient is φ = 3654751102080.
The previous prime is 11054254653037. The next prime is 11054254653047. The reversal of 11054254653042 is 24035645245011.
It is an interprime number because it is at equal distance from previous prime (11054254653037) and next prime (11054254653047).
It is a junction number, because it is equal to n+sod(n) for n = 11054254652985 and 11054254653003.
It is not an unprimeable number, because it can be changed into a prime (11054254653047) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 83197942 + ... + 83330702.
It is an arithmetic number, because the mean of its divisors is an integer number (464373197694).
Almost surely, 211054254653042 is an apocalyptic number.
11054254653042 is an abundant number, since it is smaller than the sum of its proper divisors (11235658836270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11054254653042 is a wasteful number, since it uses less digits than its factorization.
11054254653042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133643 (or 133486 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 42.
Adding to 11054254653042 its reverse (24035645245011), we get a palindrome (35089899898053).
The spelling of 11054254653042 in words is "eleven trillion, fifty-four billion, two hundred fifty-four million, six hundred fifty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •