Base | Representation |
---|---|
bin | 10100100110011110… |
… | …01000011011000001 |
3 | 1001112210121221021022 |
4 | 22103033020123001 |
5 | 140122344331001 |
6 | 5025253235225 |
7 | 541036512053 |
oct | 122317103301 |
9 | 31483557238 |
10 | 11060152001 |
11 | 4766192998 |
12 | 2188032b15 |
13 | 1073528852 |
14 | 76cc8b8d3 |
15 | 44aec211b |
hex | 2933c86c1 |
11060152001 has 4 divisors (see below), whose sum is σ = 11295474432. Its totient is φ = 10824829572.
The previous prime is 11060151937. The next prime is 11060152031. The reversal of 11060152001 is 10025106011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10025106011 = 197 ⋅50888863.
It is a cyclic number.
It is not a de Polignac number, because 11060152001 - 26 = 11060151937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11060152031) 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, 117661145 + ... + 117661238.
It is an arithmetic number, because the mean of its divisors is an integer number (2823868608).
Almost surely, 211060152001 is an apocalyptic number.
It is an amenable number.
11060152001 is a deficient number, since it is larger than the sum of its proper divisors (235322431).
11060152001 is an equidigital number, since it uses as much as digits as its factorization.
11060152001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235322430.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 11060152001 its reverse (10025106011), we get a palindrome (21085258012).
The spelling of 11060152001 in words is "eleven billion, sixty million, one hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •