Base | Representation |
---|---|
bin | 10100100010111000… |
… | …10001001010001111 |
3 | 1001110200222011001121 |
4 | 22101130101022033 |
5 | 140042142304411 |
6 | 5022300021411 |
7 | 540222542416 |
oct | 122134211217 |
9 | 31420864047 |
10 | 11030041231 |
11 | 4750197260 |
12 | 2179b31867 |
13 | 106a215321 |
14 | 768c9047d |
15 | 448525571 |
hex | 29171128f |
11030041231 has 4 divisors (see below), whose sum is σ = 12032772264. Its totient is φ = 10027310200.
The previous prime is 11030041223. The next prime is 11030041271. The reversal of 11030041231 is 13214003011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13214003011 = 11 ⋅1201273001.
It is a cyclic number.
It is not a de Polignac number, because 11030041231 - 23 = 11030041223 is a prime.
It is a super-2 number, since 2×110300412312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030041271) 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, 501365500 + ... + 501365521.
It is an arithmetic number, because the mean of its divisors is an integer number (3008193066).
Almost surely, 211030041231 is an apocalyptic number.
11030041231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11030041231 is a deficient number, since it is larger than the sum of its proper divisors (1002731033).
11030041231 is a wasteful number, since it uses less digits than its factorization.
11030041231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002731032.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11030041231 its reverse (13214003011), we get a palindrome (24244044242).
The spelling of 11030041231 in words is "eleven billion, thirty million, forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •