Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …00101000100110010011 |
3 | 10120122211022010220022021 |
4 | 32231222100220212103 |
5 | 113031213103410201 |
6 | 2052254251152311 |
7 | 133023000464104 |
oct | 16555220504623 |
9 | 3518738126267 |
10 | 1011100060051 |
11 | 35a894696344 |
12 | 143b5b445697 |
13 | 74466b58103 |
14 | 36d1a7223ab |
15 | 1b47aebcea1 |
hex | eb6a428993 |
1011100060051 has 4 divisors (see below), whose sum is σ = 1011190243392. Its totient is φ = 1011009876712.
The previous prime is 1011100060049. The next prime is 1011100060073. The reversal of 1011100060051 is 1500600011101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1011100060051 - 21 = 1011100060049 is a prime.
It is a super-2 number, since 2×10111000600512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011100060021) 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, 45074851 + ... + 45097276.
It is an arithmetic number, because the mean of its divisors is an integer number (252797560848).
Almost surely, 21011100060051 is an apocalyptic number.
1011100060051 is a deficient number, since it is larger than the sum of its proper divisors (90183341).
1011100060051 is an equidigital number, since it uses as much as digits as its factorization.
1011100060051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90183340.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 1011100060051 its reverse (1500600011101), we get a palindrome (2511700071152).
The spelling of 1011100060051 in words is "one trillion, eleven billion, one hundred million, sixty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •