Base | Representation |
---|---|
bin | 1001000110101011101001… |
… | …0101111001001101000111 |
3 | 1022102222120222212010121101 |
4 | 2101222322111321031013 |
5 | 2303002244411214231 |
6 | 33142414143200531 |
7 | 2052141021632110 |
oct | 221527225711507 |
9 | 38388528763541 |
10 | 10010400101191 |
11 | 320a428982a76 |
12 | 11580ba8a6147 |
13 | 577c909c1359 |
14 | 268712481207 |
15 | 1255d7ed4661 |
hex | 91aba579347 |
10010400101191 has 32 divisors (see below), whose sum is σ = 11716623599616. Its totient is φ = 8375648400000.
The previous prime is 10010400101153. The next prime is 10010400101197. The reversal of 10010400101191 is 19110100401001.
It is a happy number.
It is not a de Polignac number, because 10010400101191 - 215 = 10010400068423 is a prime.
It is a super-2 number, since 2×100104001011912 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010400101197) 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 31 ways as a sum of consecutive naturals, for example, 291822741 + ... + 291857041.
It is an arithmetic number, because the mean of its divisors is an integer number (366144487488).
Almost surely, 210010400101191 is an apocalyptic number.
10010400101191 is a deficient number, since it is larger than the sum of its proper divisors (1706223498425).
10010400101191 is a wasteful number, since it uses less digits than its factorization.
10010400101191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40183.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 10010400101191 its reverse (19110100401001), we get a palindrome (29120500502192).
The spelling of 10010400101191 in words is "ten trillion, ten billion, four hundred million, one hundred one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •