Base | Representation |
---|---|
bin | 10110101111010101110000… |
… | …100000010101010000001011 |
3 | 111010002212210212022120221202 |
4 | 112233111300200111100023 |
5 | 101102031342424324321 |
6 | 552412015125454415 |
7 | 30031333004252561 |
oct | 2657256040252013 |
9 | 433085725276852 |
10 | 100010201011211 |
11 | 299590a7234957 |
12 | b272791b7140b |
13 | 43a5bc9682a5a |
14 | 1a9a73b93ba31 |
15 | b8676513670b |
hex | 5af57081540b |
100010201011211 has 8 divisors (see below), whose sum is σ = 100391186580960. Its totient is φ = 99629220886272.
The previous prime is 100010201011199. The next prime is 100010201011229. The reversal of 100010201011211 is 112110102010001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100010201011211 - 214 = 100010200994827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100010201011192 and 100010201011201.
It is not an unprimeable number, because it can be changed into a prime (100010201011261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37560251 + ... + 40134683.
It is an arithmetic number, because the mean of its divisors is an integer number (12548898322620).
Almost surely, 2100010201011211 is an apocalyptic number.
100010201011211 is a deficient number, since it is larger than the sum of its proper divisors (380985569749).
100010201011211 is a wasteful number, since it uses less digits than its factorization.
100010201011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2722405.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100010201011211 its reverse (112110102010001), we get a palindrome (212120303021212).
The spelling of 100010201011211 in words is "one hundred trillion, ten billion, two hundred one million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •