Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101111010101011111110101 |
3 | 111020121111221101122100121101 |
4 | 112331233223233111133311 |
5 | 101214241211410120041 |
6 | 554450451020450101 |
7 | 30163005622431643 |
oct | 2675575357253765 |
9 | 436544841570541 |
10 | 101000111020021 |
11 | 2a1aa9a7670054 |
12 | b3b25b89a9931 |
13 | 44483674131b5 |
14 | 1ad2607cb8193 |
15 | ba23a0b65b31 |
hex | 5bdbebbd57f5 |
101000111020021 has 4 divisors (see below), whose sum is σ = 101093027406592. Its totient is φ = 100907194633452.
The previous prime is 101000111019919. The next prime is 101000111020033. The reversal of 101000111020021 is 120020111000101.
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 101000111020021 - 27 = 101000111019893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000111020091) 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, 46458191655 + ... + 46458193828.
It is an arithmetic number, because the mean of its divisors is an integer number (25273256851648).
Almost surely, 2101000111020021 is an apocalyptic number.
It is an amenable number.
101000111020021 is a deficient number, since it is larger than the sum of its proper divisors (92916386571).
101000111020021 is an equidigital number, since it uses as much as digits as its factorization.
101000111020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92916386570.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101000111020021 its reverse (120020111000101), we get a palindrome (221020222020122).
The spelling of 101000111020021 in words is "one hundred one trillion, one hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •