Base | Representation |
---|---|
bin | 1001011111110100010101… |
… | …1110100001000111001111 |
3 | 1100222021020001010000122212 |
4 | 2113331011132201013033 |
5 | 2332041142131440211 |
6 | 34113032244501035 |
7 | 2125266136026131 |
oct | 227750536410717 |
9 | 40867201100585 |
10 | 10442231124431 |
11 | 3366586272247 |
12 | 12079360aa77b |
13 | 5a990cb57492 |
14 | 281599d1d051 |
15 | 13195e13c38b |
hex | 97f457a11cf |
10442231124431 has 4 divisors (see below), whose sum is σ = 10459265759832. Its totient is φ = 10425196489032.
The previous prime is 10442231124397. The next prime is 10442231124433. The reversal of 10442231124431 is 13442113224401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10442231124431 is a prime.
It is a super-2 number, since 2×104422311244312 (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 (10442231124433) 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, 8517316781 + ... + 8517318006.
It is an arithmetic number, because the mean of its divisors is an integer number (2614816439958).
Almost surely, 210442231124431 is an apocalyptic number.
10442231124431 is a deficient number, since it is larger than the sum of its proper divisors (17034635401).
10442231124431 is an equidigital number, since it uses as much as digits as its factorization.
10442231124431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17034635400.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 10442231124431 its reverse (13442113224401), we get a palindrome (23884344348832).
The spelling of 10442231124431 in words is "ten trillion, four hundred forty-two billion, two hundred thirty-one million, one hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •