Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1010101011010001101011 |
3 | 1022110001010212211002022021 |
4 | 2101223132022223101223 |
5 | 2303010012242442311 |
6 | 33142553533405311 |
7 | 2052161640446602 |
oct | 221533612532153 |
9 | 38401125732267 |
10 | 10011001140331 |
11 | 320a707180634 |
12 | 1158248039837 |
13 | 578058391c09 |
14 | 26876c218a39 |
15 | 125620b5a171 |
hex | 91ade2ab46b |
10011001140331 has 16 divisors (see below), whose sum is σ = 10350759545280. Its totient is φ = 9678630850560.
The previous prime is 10011001140281. The next prime is 10011001140337. The reversal of 10011001140331 is 13304110011001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011001140331 is a prime.
It is a super-2 number, since 2×100110011403312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011001140337) 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 15 ways as a sum of consecutive naturals, for example, 5917246 + ... + 7418611.
It is an arithmetic number, because the mean of its divisors is an integer number (646922471580).
Almost surely, 210011001140331 is an apocalyptic number.
10011001140331 is a deficient number, since it is larger than the sum of its proper divisors (339758404949).
10011001140331 is a wasteful number, since it uses less digits than its factorization.
10011001140331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13336134.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10011001140331 its reverse (13304110011001), we get a palindrome (23315111151332).
The spelling of 10011001140331 in words is "ten trillion, eleven billion, one million, one hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •