Base | Representation |
---|---|
bin | 11101011001011101010… |
… | …10001000011010001101 |
3 | 10120120020121120020001211 |
4 | 32230232222020122031 |
5 | 113022141112022424 |
6 | 2052011130534421 |
7 | 132656136164524 |
oct | 16545652103215 |
9 | 3516217506054 |
10 | 1010100110989 |
11 | 35a4211a7862 |
12 | 143920597411 |
13 | 74337938188 |
14 | 36c639c94bb |
15 | 1b41d2ebb94 |
hex | eb2ea8868d |
1010100110989 has 8 divisors (see below), whose sum is σ = 1012872742112. Its totient is φ = 1007327826000.
The previous prime is 1010100110959. The next prime is 1010100111001. The reversal of 1010100110989 is 9890110010101.
1010100110989 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 a de Polignac number, because none of the positive numbers 2k-1010100110989 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010100110989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010100110909) 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, 6428614 + ... + 6583864.
It is an arithmetic number, because the mean of its divisors is an integer number (126609092764).
Almost surely, 21010100110989 is an apocalyptic number.
It is an amenable number.
1010100110989 is a deficient number, since it is larger than the sum of its proper divisors (2772631123).
1010100110989 is a wasteful number, since it uses less digits than its factorization.
1010100110989 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173067.
The product of its (nonzero) digits is 648, while the sum is 31.
The spelling of 1010100110989 in words is "one trillion, ten billion, one hundred million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •