Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …110010110001111100100001 |
3 | 111020222011101020001200201121 |
4 | 112333031221302301330201 |
5 | 101222414332041200001 |
6 | 555005055102132241 |
7 | 30203210164444612 |
oct | 2677155162617441 |
9 | 436864336050647 |
10 | 101101010100001 |
11 | 2a23977455a25a |
12 | b40a077881081 |
13 | 4454a27286612 |
14 | 1ad745a4d5c09 |
15 | ba4d08c996a1 |
hex | 5bf369cb1f21 |
101101010100001 has 4 divisors (see below), whose sum is σ = 102380769721600. Its totient is φ = 99821250478404.
The previous prime is 101101010099989. The next prime is 101101010100049. The reversal of 101101010100001 is 100001010101101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101101010100001 - 29 = 101101010099489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101101010100401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 639879810681 + ... + 639879810838.
It is an arithmetic number, because the mean of its divisors is an integer number (25595192430400).
Almost surely, 2101101010100001 is an apocalyptic number.
It is an amenable number.
101101010100001 is a deficient number, since it is larger than the sum of its proper divisors (1279759621599).
101101010100001 is an equidigital number, since it uses as much as digits as its factorization.
101101010100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279759621598.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101101010100001 its reverse (100001010101101), we get a palindrome (201102020201102).
The spelling of 101101010100001 in words is "one hundred one trillion, one hundred one billion, ten million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •