Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101111010011000011010001 |
3 | 111020121111221101121211212021 |
4 | 112331233223233103003101 |
5 | 101214241211404310001 |
6 | 554450451020331441 |
7 | 30163005622360510 |
oct | 2675575357230321 |
9 | 436544841554767 |
10 | 101000111010001 |
11 | 2a1aa9a7663575 |
12 | b3b25b89a3b81 |
13 | 444836740b778 |
14 | 1ad2607cb4677 |
15 | ba23a0b62ba1 |
hex | 5bdbebbd30d1 |
101000111010001 has 16 divisors (see below), whose sum is σ = 116226683711488. Its totient is φ = 85973365818000.
The previous prime is 101000111009977. The next prime is 101000111010089. The reversal of 101000111010001 is 100010111000101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101000111010001 - 27 = 101000111009873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (101000111610001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10135965 + ... + 17456746.
It is an arithmetic number, because the mean of its divisors is an integer number (7264167731968).
Almost surely, 2101000111010001 is an apocalyptic number.
It is an amenable number.
101000111010001 is a deficient number, since it is larger than the sum of its proper divisors (15226572701487).
101000111010001 is a wasteful number, since it uses less digits than its factorization.
101000111010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27596332.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101000111010001 its reverse (100010111000101), we get a palindrome (201010222010102).
The spelling of 101000111010001 in words is "one hundred one trillion, one hundred eleven million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •