Base | Representation |
---|---|
bin | 1010011010100011000010… |
… | …1110000110011000111111 |
3 | 1111112201112211102210222020 |
4 | 2212220300232012120333 |
5 | 3000104024222433203 |
6 | 40204335253451223 |
7 | 2261215262500221 |
oct | 246506056063077 |
9 | 44481484383866 |
10 | 11451200202303 |
11 | 3715476a89094 |
12 | 134b39b940b13 |
13 | 650ac7367694 |
14 | 2b835360c411 |
15 | 14cd12ec3153 |
hex | a6a30b8663f |
11451200202303 has 16 divisors (see below), whose sum is σ = 15771744460800. Its totient is φ = 7382736980640.
The previous prime is 11451200202293. The next prime is 11451200202353. The reversal of 11451200202303 is 30320200215411.
11451200202303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11451200202303 - 24 = 11451200202287 is a prime.
It is a super-2 number, since 2×114512002023032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11451200202353) 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, 42649768 + ... + 42917421.
It is an arithmetic number, because the mean of its divisors is an integer number (985734028800).
Almost surely, 211451200202303 is an apocalyptic number.
11451200202303 is a deficient number, since it is larger than the sum of its proper divisors (4320544258497).
11451200202303 is a wasteful number, since it uses less digits than its factorization.
11451200202303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85568662.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 11451200202303 its reverse (30320200215411), we get a palindrome (41771400417714).
The spelling of 11451200202303 in words is "eleven trillion, four hundred fifty-one billion, two hundred million, two hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •