Base | Representation |
---|---|
bin | 1010000000111111010100… |
… | …1010100011101001001011 |
3 | 1102222202012011222011221201 |
4 | 2200033311022203221023 |
5 | 2420410302234140003 |
6 | 35230521232245031 |
7 | 2214412313451613 |
oct | 240176512435113 |
9 | 42882164864851 |
10 | 11012114365003 |
11 | 3566236523714 |
12 | 129a27a9a0777 |
13 | 61b59018b97b |
14 | 2a0dbc443a43 |
15 | 1416b4ebab1d |
hex | a03f52a3a4b |
11012114365003 has 4 divisors (see below), whose sum is σ = 11034007237008. Its totient is φ = 10990221493000.
The previous prime is 11012114364991. The next prime is 11012114365009. The reversal of 11012114365003 is 30056341121011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11012114365003 - 25 = 11012114364971 is a prime.
It is a super-3 number, since 3×110121143650033 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012114365009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10946435248 + ... + 10946436253.
It is an arithmetic number, because the mean of its divisors is an integer number (2758501809252).
Almost surely, 211012114365003 is an apocalyptic number.
11012114365003 is a deficient number, since it is larger than the sum of its proper divisors (21892872005).
11012114365003 is an equidigital number, since it uses as much as digits as its factorization.
11012114365003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21892872004.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 11012114365003 its reverse (30056341121011), we get a palindrome (41068455486014).
The spelling of 11012114365003 in words is "eleven trillion, twelve billion, one hundred fourteen million, three hundred sixty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •