Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101011100001010110100001 |
3 | 111020121111221022202112211121 |
4 | 112331233223223201112201 |
5 | 101214241211131120001 |
6 | 554450450543212241 |
7 | 30163005611065303 |
oct | 2675575353412641 |
9 | 436544838675747 |
10 | 101000110020001 |
11 | 2a1aa9a7047795 |
12 | b3b25b85a7081 |
13 | 4448367152c7a |
14 | 1ad2607ad7973 |
15 | ba23a0a196a1 |
hex | 5bdbebae15a1 |
101000110020001 has 24 divisors (see below), whose sum is σ = 112156532163144. Its totient is φ = 90583661629440.
The previous prime is 101000110019999. The next prime is 101000110020011. The reversal of 101000110020001 is 100020011000101.
It can be written as a sum of positive squares in 4 ways, for example, as 16199015040000 + 84801094980001 = 4024800^2 + 9208751^2 .
It is not a de Polignac number, because 101000110020001 - 21 = 101000110019999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101000110020011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37896456 + ... + 40473961.
It is an arithmetic number, because the mean of its divisors is an integer number (4673188840131).
Almost surely, 2101000110020001 is an apocalyptic number.
It is an amenable number.
101000110020001 is a deficient number, since it is larger than the sum of its proper divisors (11156422143143).
101000110020001 is an equidigital number, since it uses as much as digits as its factorization.
101000110020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78370561 (or 78370518 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101000110020001 its reverse (100020011000101), we get a palindrome (201020121020102).
The spelling of 101000110020001 in words is "one hundred one trillion, one hundred ten million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •