Base | Representation |
---|---|
bin | 1010000110001110001110… |
… | …0010101101111101000111 |
3 | 1110022100020101011010122100 |
4 | 2201203203202231331013 |
5 | 2423343410313201043 |
6 | 35340105552403143 |
7 | 2224044142440600 |
oct | 241434342557507 |
9 | 43270211133570 |
10 | 11102013022023 |
11 | 35a0378a16280 |
12 | 12b37898464b3 |
13 | 626bb8cba091 |
14 | 2a54a9ac0da7 |
15 | 143bc74c9cd3 |
hex | a18e38adf47 |
11102013022023 has 72 divisors (see below), whose sum is σ = 20479878516240. Its totient is φ = 5730544834560.
The previous prime is 11102013022021. The next prime is 11102013022031. The reversal of 11102013022023 is 32022031020111.
It is not a de Polignac number, because 11102013022023 - 21 = 11102013022021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11102013021987 and 11102013022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102013022021) 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 71 ways as a sum of consecutive naturals, for example, 6526938 + ... + 8050151.
It is an arithmetic number, because the mean of its divisors is an integer number (284442757170).
Almost surely, 211102013022023 is an apocalyptic number.
11102013022023 is a deficient number, since it is larger than the sum of its proper divisors (9377865494217).
11102013022023 is a wasteful number, since it uses less digits than its factorization.
11102013022023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14577277 (or 14577267 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11102013022023 its reverse (32022031020111), we get a palindrome (43124044042134).
The spelling of 11102013022023 in words is "eleven trillion, one hundred two billion, thirteen million, twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •