Base | Representation |
---|---|
bin | 1010000011010001111001… |
… | …1011101101010101001101 |
3 | 1110010111202100102022122120 |
4 | 2200310132123231111031 |
5 | 2422031343111321103 |
6 | 35300545444403153 |
7 | 2220304342143555 |
oct | 240643633552515 |
9 | 43114670368576 |
10 | 11051461432653 |
11 | 358099795aa44 |
12 | 12a5a200a64b9 |
13 | 6221c0ba1615 |
14 | 2a2c7200a165 |
15 | 1427194cb253 |
hex | a0d1e6ed54d |
11051461432653 has 8 divisors (see below), whose sum is σ = 14735335874400. Its totient is φ = 7367613973008.
The previous prime is 11051461432643. The next prime is 11051461432679. The reversal of 11051461432653 is 35623416415011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11051461432653 - 218 = 11051461170509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051461432603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5769658 + ... + 7442571.
It is an arithmetic number, because the mean of its divisors is an integer number (1841916984300).
Almost surely, 211051461432653 is an apocalyptic number.
It is an amenable number.
11051461432653 is a deficient number, since it is larger than the sum of its proper divisors (3683874441747).
11051461432653 is a wasteful number, since it uses less digits than its factorization.
11051461432653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13491051.
The product of its (nonzero) digits is 259200, while the sum is 42.
Adding to 11051461432653 its reverse (35623416415011), we get a palindrome (46674877847664).
The spelling of 11051461432653 in words is "eleven trillion, fifty-one billion, four hundred sixty-one million, four hundred thirty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •