Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1000010110110101110011 |
3 | 1022202120010100021211122111 |
4 | 2102332130320112311303 |
5 | 2310440001113212321 |
6 | 33251531050150151 |
7 | 2061464616415405 |
oct | 222763470266563 |
9 | 38676110254574 |
10 | 10100100132211 |
11 | 3244479240a11 |
12 | 1171573122357 |
13 | 58358762699b |
14 | 26cbc15b6b75 |
15 | 127ad7d5b5e1 |
hex | 92f9ce16d73 |
10100100132211 has 4 divisors (see below), whose sum is σ = 10539234920592. Its totient is φ = 9660965343832.
The previous prime is 10100100132203. The next prime is 10100100132319. The reversal of 10100100132211 is 11223100100101.
It is a happy number.
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 10100100132211 - 23 = 10100100132203 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10100100132191 and 10100100132200.
It is not an unprimeable number, because it can be changed into a prime (10100100132011) 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, 219567394156 + ... + 219567394201.
It is an arithmetic number, because the mean of its divisors is an integer number (2634808730148).
Almost surely, 210100100132211 is an apocalyptic number.
10100100132211 is a deficient number, since it is larger than the sum of its proper divisors (439134788381).
10100100132211 is an equidigital number, since it uses as much as digits as its factorization.
10100100132211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439134788380.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10100100132211 its reverse (11223100100101), we get a palindrome (21323200232312).
The spelling of 10100100132211 in words is "ten trillion, one hundred billion, one hundred million, one hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •