Base | Representation |
---|---|
bin | 10110101111010101110001… |
… | …000011011000110110110011 |
3 | 111010002212211111121110222201 |
4 | 112233111301003120312303 |
5 | 101102031402302413021 |
6 | 552412020054444031 |
7 | 30031333145336155 |
oct | 2657256103306663 |
9 | 433085744543881 |
10 | 100010210201011 |
11 | 29959101441330 |
12 | b272795063617 |
13 | 43a5bcb54c8c6 |
14 | 1a9a73cc50ad5 |
15 | b86765d4e591 |
hex | 5af5710d8db3 |
100010210201011 has 4 divisors (see below), whose sum is σ = 109102047492024. Its totient is φ = 90918372910000.
The previous prime is 100010210200993. The next prime is 100010210201023. The reversal of 100010210201011 is 110102012010001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100010210201011 - 223 = 100010201812403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100010210201051) 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, 4545918645490 + ... + 4545918645511.
It is an arithmetic number, because the mean of its divisors is an integer number (27275511873006).
Almost surely, 2100010210201011 is an apocalyptic number.
100010210201011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100010210201011 is a deficient number, since it is larger than the sum of its proper divisors (9091837291013).
100010210201011 is an equidigital number, since it uses as much as digits as its factorization.
100010210201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9091837291012.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100010210201011 its reverse (110102012010001), we get a palindrome (210112222211012).
The spelling of 100010210201011 in words is "one hundred trillion, ten billion, two hundred ten million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •