Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …010101001010000010000010 |
3 | 111020122120022221011222202000 |
4 | 112331321323111022002002 |
5 | 101214431223130323020 |
6 | 554455510251204430 |
7 | 30163545320343033 |
oct | 2675717325120202 |
9 | 436576287158660 |
10 | 101011110011010 |
11 | 2a204631279851 |
12 | b3b4768446716 |
13 | 44493cb0764a4 |
14 | 1ad2d6c9a4a8a |
15 | ba27e65a6090 |
hex | 5bde7b54a082 |
101011110011010 has 128 divisors (see below), whose sum is σ = 269501202432000. Its totient is φ = 26922475797696.
The previous prime is 101011110010973. The next prime is 101011110011023. The reversal of 101011110011010 is 10110011110101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101011110010983 and 101011110011001.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5339126331 + ... + 5339145249.
It is an arithmetic number, because the mean of its divisors is an integer number (2105478144000).
Almost surely, 2101011110011010 is an apocalyptic number.
101011110011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101011110011010 is an abundant number, since it is smaller than the sum of its proper divisors (168490092420990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011110011010 is a wasteful number, since it uses less digits than its factorization.
101011110011010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28037 (or 28031 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101011110011010 its reverse (10110011110101), we get a palindrome (111121121121111).
The spelling of 101011110011010 in words is "one hundred one trillion, eleven billion, one hundred ten million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •