Base | Representation |
---|---|
bin | 10110101111011110111111… |
… | …110101111100010101111001 |
3 | 111010010211102021102121011102 |
4 | 112233132333311330111321 |
5 | 101102212202213323001 |
6 | 552420335411141145 |
7 | 30032133602334323 |
oct | 2657367765742571 |
9 | 433124367377142 |
10 | 100020122011001 |
11 | 299623283a0935 |
12 | b2746a05a47b5 |
13 | 43a6b1ab9cc2a |
14 | 1a9addd3b8613 |
15 | b86b460dbe6b |
hex | 5af7bfd7c579 |
100020122011001 has 4 divisors (see below), whose sum is σ = 101428856123904. Its totient is φ = 98611387898100.
The previous prime is 100020122010983. The next prime is 100020122011003. The reversal of 100020122011001 is 100110221020001.
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 100020122011001 - 26 = 100020122010937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100020122011003) 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, 704367056345 + ... + 704367056486.
It is an arithmetic number, because the mean of its divisors is an integer number (25357214030976).
Almost surely, 2100020122011001 is an apocalyptic number.
It is an amenable number.
100020122011001 is a deficient number, since it is larger than the sum of its proper divisors (1408734112903).
100020122011001 is an equidigital number, since it uses as much as digits as its factorization.
100020122011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1408734112902.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100020122011001 its reverse (100110221020001), we get a palindrome (200130343031002).
The spelling of 100020122011001 in words is "one hundred trillion, twenty billion, one hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •