Base | Representation |
---|---|
bin | 1001001011111010010000… |
… | …0010000111011101110111 |
3 | 1022202120102201002102022011 |
4 | 2102332210002013131313 |
5 | 2310440222323144231 |
6 | 33251551014145051 |
7 | 2061500604403561 |
oct | 222764402073567 |
9 | 38676381072264 |
10 | 10100220131191 |
11 | 324452aa51a23 |
12 | 11715a7352187 |
13 | 5835a64502b8 |
14 | 26cbd34d2331 |
15 | 127ae36619b1 |
hex | 92fa4087777 |
10100220131191 has 8 divisors (see below), whose sum is σ = 10176162702464. Its totient is φ = 10024396687800.
The previous prime is 10100220131153. The next prime is 10100220131207. The reversal of 10100220131191 is 19113102200101.
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 10100220131191 - 27 = 10100220131063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100220131791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29611761 + ... + 29950906.
It is an arithmetic number, because the mean of its divisors is an integer number (1272020337808).
Almost surely, 210100220131191 is an apocalyptic number.
10100220131191 is a deficient number, since it is larger than the sum of its proper divisors (75942571273).
10100220131191 is a wasteful number, since it uses less digits than its factorization.
10100220131191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59563941.
The product of its (nonzero) digits is 108, while the sum is 22.
Adding to 10100220131191 its reverse (19113102200101), we get a palindrome (29213322331292).
The spelling of 10100220131191 in words is "ten trillion, one hundred billion, two hundred twenty million, one hundred thirty-one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •