Base | Representation |
---|---|
bin | 1010000110001011001100… |
… | …0110000011010100111111 |
3 | 1110022021010201200112211212 |
4 | 2201202303012003110333 |
5 | 2423340224222413043 |
6 | 35335453155035035 |
7 | 2224015042535222 |
oct | 241426306032477 |
9 | 43267121615755 |
10 | 11101200201023 |
11 | 359aaa1118889 |
12 | 12b35a159ba7b |
13 | 626ab97985ca |
14 | 2a542db795b9 |
15 | 143b7ae6e018 |
hex | a18b318353f |
11101200201023 has 16 divisors (see below), whose sum is σ = 11229164369280. Its totient is φ = 10973700328800.
The previous prime is 11101200200989. The next prime is 11101200201041. The reversal of 11101200201023 is 32010200210111.
It is a cyclic number.
It is not a de Polignac number, because 11101200201023 - 212 = 11101200196927 is a prime.
It is a super-2 number, since 2×111012002010232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101200200989 and 11101200201007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101200201053) 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, 154600613 + ... + 154672401.
It is an arithmetic number, because the mean of its divisors is an integer number (701822773080).
Almost surely, 211101200201023 is an apocalyptic number.
11101200201023 is a deficient number, since it is larger than the sum of its proper divisors (127964168257).
11101200201023 is a wasteful number, since it uses less digits than its factorization.
11101200201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74998.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11101200201023 its reverse (32010200210111), we get a palindrome (43111400411134).
The spelling of 11101200201023 in words is "eleven trillion, one hundred one billion, two hundred million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •