Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10101110101111101 |
3 | 1001110000111200121011 |
4 | 22100312311311331 |
5 | 140032134330023 |
6 | 5021305435221 |
7 | 540043260322 |
oct | 122066656575 |
9 | 31400450534 |
10 | 11020230013 |
11 | 47456a5a11 |
12 | 217679bb11 |
13 | 106818b680 |
14 | 767858b49 |
15 | 44773850d |
hex | 290db5d7d |
11020230013 has 8 divisors (see below), whose sum is σ = 12120450048. Its totient is φ = 9956082864.
The previous prime is 11020229947. The next prime is 11020230029. The reversal of 11020230013 is 31003202011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11020230013 - 229 = 10483359101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020229975 and 11020230002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020233013) 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, 9017581 + ... + 9018802.
It is an arithmetic number, because the mean of its divisors is an integer number (1515056256).
Almost surely, 211020230013 is an apocalyptic number.
11020230013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11020230013 is a deficient number, since it is larger than the sum of its proper divisors (1100220035).
11020230013 is a wasteful number, since it uses less digits than its factorization.
11020230013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18036443.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 11020230013 its reverse (31003202011), we get a palindrome (42023432024).
The spelling of 11020230013 in words is "eleven billion, twenty million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •