Base | Representation |
---|---|
bin | 10110110010000111100010… |
… | …111110001011111011110011 |
3 | 111010210010112221110001111022 |
4 | 112302013202332023323303 |
5 | 101113143323100013021 |
6 | 553035425545410055 |
7 | 30051201445015262 |
oct | 2662074276137363 |
9 | 433703487401438 |
10 | 100201100001011 |
11 | 29a22058793419 |
12 | b2a378979992b |
13 | 43bac00316399 |
14 | 1aa5a8b0325d9 |
15 | b8b6d95ca1ab |
hex | 5b21e2f8bef3 |
100201100001011 has 4 divisors (see below), whose sum is σ = 100204129912224. Its totient is φ = 100198070089800.
The previous prime is 100201100001001. The next prime is 100201100001019. The reversal of 100201100001011 is 110100001102001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100201100001011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100201100001011.
It is not an unprimeable number, because it can be changed into a prime (100201100001019) 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, 1514906000 + ... + 1514972141.
It is an arithmetic number, because the mean of its divisors is an integer number (25051032478056).
Almost surely, 2100201100001011 is an apocalyptic number.
100201100001011 is a deficient number, since it is larger than the sum of its proper divisors (3029911213).
100201100001011 is an equidigital number, since it uses as much as digits as its factorization.
100201100001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3029911212.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100201100001011 its reverse (110100001102001), we get a palindrome (210301101103012).
The spelling of 100201100001011 in words is "one hundred trillion, two hundred one billion, one hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •