Base | Representation |
---|---|
bin | 11101011011001111110… |
… | …01110001000101001011 |
3 | 10120122201112201121021111 |
4 | 32231213321301011023 |
5 | 113031122442323201 |
6 | 2052250315351151 |
7 | 133022010354643 |
oct | 16554771610513 |
9 | 3518645647244 |
10 | 1011060511051 |
11 | 35a874333618 |
12 | 143b4a1524b7 |
13 | 7445b8bb936 |
14 | 36d15389523 |
15 | 1b4777a9b51 |
hex | eb67e7114b |
1011060511051 has 16 divisors (see below), whose sum is σ = 1030023025920. Its totient is φ = 992240686080.
The previous prime is 1011060510991. The next prime is 1011060511061. The reversal of 1011060511051 is 1501150601101.
It is a cyclic number.
It is not a de Polignac number, because 1011060511051 - 231 = 1008913027403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011060511061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34838835 + ... + 34867843.
It is an arithmetic number, because the mean of its divisors is an integer number (64376439120).
Almost surely, 21011060511051 is an apocalyptic number.
1011060511051 is a deficient number, since it is larger than the sum of its proper divisors (18962514869).
1011060511051 is a wasteful number, since it uses less digits than its factorization.
1011060511051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31446.
The product of its (nonzero) digits is 150, while the sum is 22.
The spelling of 1011060511051 in words is "one trillion, eleven billion, sixty million, five hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •