Base | Representation |
---|---|
bin | 10100100011011000… |
… | …01001000010111101 |
3 | 1001110222210112222022 |
4 | 22101230021002331 |
5 | 140044223433201 |
6 | 5022525125525 |
7 | 540303113003 |
oct | 122154110275 |
9 | 31428715868 |
10 | 11034202301 |
11 | 4752579561 |
12 | 217b3b98a5 |
13 | 106b0412b5 |
14 | 769654a73 |
15 | 448a9841b |
hex | 291b090bd |
11034202301 has 8 divisors (see below), whose sum is σ = 11113767000. Its totient is φ = 10954711360.
The previous prime is 11034202261. The next prime is 11034202303. The reversal of 11034202301 is 10320243011.
It can be written as a sum of positive squares in 4 ways, for example, as 66667225 + 10967535076 = 8165^2 + 104726^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11034202301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11034202301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11034202303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 301715 + ... + 336303.
It is an arithmetic number, because the mean of its divisors is an integer number (1389220875).
Almost surely, 211034202301 is an apocalyptic number.
It is an amenable number.
11034202301 is a deficient number, since it is larger than the sum of its proper divisors (79564699).
11034202301 is a wasteful number, since it uses less digits than its factorization.
11034202301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36879.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11034202301 its reverse (10320243011), we get a palindrome (21354445312).
The spelling of 11034202301 in words is "eleven billion, thirty-four million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •