Base | Representation |
---|---|
bin | 1010000001000111001000… |
… | …1110100001000111110011 |
3 | 1102222221121102002021212122 |
4 | 2200101302032201013303 |
5 | 2420424101403232001 |
6 | 35231505343544455 |
7 | 2214515312000423 |
oct | 240216216410763 |
9 | 42887542067778 |
10 | 11014212555251 |
11 | 3567112936044 |
12 | 129a7655bb12b |
13 | 61b835a94b69 |
14 | 2a113ad7c483 |
15 | 1417892c6b1b |
hex | a04723a11f3 |
11014212555251 has 4 divisors (see below), whose sum is σ = 11014274610504. Its totient is φ = 11014150500000.
The previous prime is 11014212555211. The next prime is 11014212555257. The reversal of 11014212555251 is 15255521241011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11014212555251 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014212555257) 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, 30760625 + ... + 31116626.
It is an arithmetic number, because the mean of its divisors is an integer number (2753568652626).
Almost surely, 211014212555251 is an apocalyptic number.
11014212555251 is a deficient number, since it is larger than the sum of its proper divisors (62055253).
11014212555251 is an equidigital number, since it uses as much as digits as its factorization.
11014212555251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62055252.
The product of its (nonzero) digits is 20000, while the sum is 35.
Adding to 11014212555251 its reverse (15255521241011), we get a palindrome (26269733796262).
The spelling of 11014212555251 in words is "eleven trillion, fourteen billion, two hundred twelve million, five hundred fifty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •