Base | Representation |
---|---|
bin | 10100100111111010… |
… | …10100101110001011 |
3 | 1001120122102010200212 |
4 | 22103331110232023 |
5 | 140133444323003 |
6 | 5030404551335 |
7 | 541244444216 |
oct | 122375245613 |
9 | 31518363625 |
10 | 11072261003 |
11 | 4772003631 |
12 | 21900b254b |
13 | 1075ba833b |
14 | 77072077d |
15 | 44c0b4dd8 |
hex | 293f54b8b |
11072261003 has 4 divisors (see below), whose sum is σ = 11196668520. Its totient is φ = 10947853488.
The previous prime is 11072260999. The next prime is 11072261021. The reversal of 11072261003 is 30016227011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30016227011 = 191 ⋅157153021.
It is a cyclic number.
It is not a de Polignac number, because 11072261003 - 22 = 11072260999 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 11072261003.
It is not an unprimeable number, because it can be changed into a prime (11072221003) 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 3 ways as a sum of consecutive naturals, for example, 62203625 + ... + 62203802.
It is an arithmetic number, because the mean of its divisors is an integer number (2799167130).
Almost surely, 211072261003 is an apocalyptic number.
11072261003 is a deficient number, since it is larger than the sum of its proper divisors (124407517).
11072261003 is an equidigital number, since it uses as much as digits as its factorization.
11072261003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124407516.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 11072261003 its reverse (30016227011), we get a palindrome (41088488014).
The spelling of 11072261003 in words is "eleven billion, seventy-two million, two hundred sixty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •