Base | Representation |
---|---|
bin | 10100100010111000… |
… | …11111110110100101 |
3 | 1001110201002012121120 |
4 | 22101130133312211 |
5 | 140042201221123 |
6 | 5022301204153 |
7 | 540223213032 |
oct | 122134376645 |
9 | 31421065546 |
10 | 11030101413 |
11 | 47502284a1 |
12 | 2179b60659 |
13 | 106a236836 |
14 | 768ca8389 |
15 | 4485382e3 |
hex | 29171fda5 |
11030101413 has 48 divisors (see below), whose sum is σ = 15909861888. Its totient is φ = 6789744000.
The previous prime is 11030101409. The next prime is 11030101427. The reversal of 11030101413 is 31410103011.
It is not a de Polignac number, because 11030101413 - 22 = 11030101409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11030101392 and 11030101401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030101463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5652588 + ... + 5654538.
It is an arithmetic number, because the mean of its divisors is an integer number (331455456).
Almost surely, 211030101413 is an apocalyptic number.
It is an amenable number.
11030101413 is a deficient number, since it is larger than the sum of its proper divisors (4879760475).
11030101413 is a wasteful number, since it uses less digits than its factorization.
11030101413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106 (or 2075 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11030101413 its reverse (31410103011), we get a palindrome (42440204424).
The spelling of 11030101413 in words is "eleven billion, thirty million, one hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •