Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …100101111101110111010001 |
3 | 111010110111222201101212111221 |
4 | 112300303220211331313101 |
5 | 101110204312000031001 |
6 | 552530205234005041 |
7 | 30041531622452362 |
oct | 2660635045756721 |
9 | 433414881355457 |
10 | 100111000002001 |
11 | 2999792268161a |
12 | b28a223416781 |
13 | 43b2571880bc1 |
14 | 1aa1580b43b69 |
15 | b891b45991a1 |
hex | 5b0ce897ddd1 |
100111000002001 has 4 divisors (see below), whose sum is σ = 100111032103732. Its totient is φ = 100110967900272.
The previous prime is 100111000001981. The next prime is 100111000002019. The reversal of 100111000002001 is 100200000111001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 40947828104401 + 59163171897600 = 6399049^2 + 7691760^2 .
It is a cyclic number.
It is not a de Polignac number, because 100111000002001 - 227 = 100110865784273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100111000002061) 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, 10800570 + ... + 17800963.
It is an arithmetic number, because the mean of its divisors is an integer number (25027758025933).
Almost surely, 2100111000002001 is an apocalyptic number.
It is an amenable number.
100111000002001 is a deficient number, since it is larger than the sum of its proper divisors (32101731).
100111000002001 is an equidigital number, since it uses as much as digits as its factorization.
100111000002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32101730.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100111000002001 its reverse (100200000111001), we get a palindrome (200311000113002).
The spelling of 100111000002001 in words is "one hundred trillion, one hundred eleven billion, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •