Base | Representation |
---|---|
bin | 1010000000111110111100… |
… | …0001011001110011010111 |
3 | 1102222201221000001001020021 |
4 | 2200033233001121303113 |
5 | 2420410044343131403 |
6 | 35230503111250011 |
7 | 2214406622441650 |
oct | 240175701316327 |
9 | 42881830031207 |
10 | 11012011302103 |
11 | 356619332aa69 |
12 | 129a250379907 |
13 | 61b574a14cc6 |
14 | 2a0dac896527 |
15 | 1416aae0d8bd |
hex | a03ef059cd7 |
11012011302103 has 8 divisors (see below), whose sum is σ = 12585199749408. Its totient is φ = 9438833848704.
The previous prime is 11012011302101. The next prime is 11012011302107. The reversal of 11012011302103 is 30120311021011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11012011302103 - 21 = 11012011302101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012011302101) 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 7 ways as a sum of consecutive naturals, for example, 476926 + ... + 4717147.
It is an arithmetic number, because the mean of its divisors is an integer number (1573149968676).
Almost surely, 211012011302103 is an apocalyptic number.
11012011302103 is a deficient number, since it is larger than the sum of its proper divisors (1573188447305).
11012011302103 is an equidigital number, since it uses as much as digits as its factorization.
11012011302103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5496953.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11012011302103 its reverse (30120311021011), we get a palindrome (41132322323114).
The spelling of 11012011302103 in words is "eleven trillion, twelve billion, eleven million, three hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •