Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0011001100111010111001 |
3 | 1102222120001012111011222210 |
4 | 2200031332103030322321 |
5 | 2420342211224030041 |
6 | 35225551313205333 |
7 | 2214312020032113 |
oct | 240157623147271 |
9 | 42876035434883 |
10 | 11010120142521 |
11 | 3565402872865 |
12 | 1299a02b60849 |
13 | 61b332c88276 |
14 | 2a0c6d6503b3 |
15 | 1415e9d9a016 |
hex | a037e4cceb9 |
11010120142521 has 16 divisors (see below), whose sum is σ = 14866186752000. Its totient is φ = 7247069336208.
The previous prime is 11010120142513. The next prime is 11010120142529. The reversal of 11010120142521 is 12524102101011.
It is an interprime number because it is at equal distance from previous prime (11010120142513) and next prime (11010120142529).
It is not a de Polignac number, because 11010120142521 - 23 = 11010120142513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11010120142529) 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 15 ways as a sum of consecutive naturals, for example, 19919530 + ... + 20464796.
It is an arithmetic number, because the mean of its divisors is an integer number (929136672000).
Almost surely, 211010120142521 is an apocalyptic number.
It is an amenable number.
11010120142521 is a deficient number, since it is larger than the sum of its proper divisors (3856066609479).
11010120142521 is an equidigital number, since it uses as much as digits as its factorization.
11010120142521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630548.
The product of its (nonzero) digits is 160, while the sum is 21.
Adding to 11010120142521 its reverse (12524102101011), we get a palindrome (23534222243532).
The spelling of 11010120142521 in words is "eleven trillion, ten billion, one hundred twenty million, one hundred forty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •