Base | Representation |
---|---|
bin | 11101011011001000100… |
… | …10111100001000011011 |
3 | 10120122120022212101011101 |
4 | 32231210102330020123 |
5 | 113031012000013201 |
6 | 2052240314412231 |
7 | 133020344134645 |
oct | 16554422741033 |
9 | 3518508771141 |
10 | 1011000001051 |
11 | 35a843164557 |
12 | 143b31a31077 |
13 | 7444c1c37c1 |
14 | 36d0b317895 |
15 | 1b472305d01 |
hex | eb644bc21b |
1011000001051 has 8 divisors (see below), whose sum is σ = 1036386396864. Its totient is φ = 985648265280.
The previous prime is 1011000001021. The next prime is 1011000001127. The reversal of 1011000001051 is 1501000001101.
1011000001051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1011000001051 - 213 = 1010999992859 is a prime.
It is a super-2 number, since 2×10110000010512 (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 (1011000001021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8605936 + ... + 8722621.
It is an arithmetic number, because the mean of its divisors is an integer number (129548299608).
Almost surely, 21011000001051 is an apocalyptic number.
1011000001051 is a deficient number, since it is larger than the sum of its proper divisors (25386395813).
1011000001051 is a wasteful number, since it uses less digits than its factorization.
1011000001051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17330021.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 1011000001051 its reverse (1501000001101), we get a palindrome (2512000002152).
The spelling of 1011000001051 in words is "one trillion, eleven billion, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •