Base | Representation |
---|---|
bin | 1001010011100001100100… |
… | …1001110011110110010111 |
3 | 1100020002002100122121210020 |
4 | 2110320121021303312113 |
5 | 2320111124212214033 |
6 | 33432023331400223 |
7 | 2104111363660302 |
oct | 224703111636627 |
9 | 40202070577706 |
10 | 10231034101143 |
11 | 3294a59033799 |
12 | 1192a14753073 |
13 | 592a22b5954b |
14 | 275282b21b39 |
15 | 12b1ecbab6b3 |
hex | 94e19273d97 |
10231034101143 has 4 divisors (see below), whose sum is σ = 13641378801528. Its totient is φ = 6820689400760.
The previous prime is 10231034101129. The next prime is 10231034101159. The reversal of 10231034101143 is 34110143013201.
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 10231034101143 - 28 = 10231034100887 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231034101243) 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 3 ways as a sum of consecutive naturals, for example, 1705172350188 + ... + 1705172350193.
It is an arithmetic number, because the mean of its divisors is an integer number (3410344700382).
Almost surely, 210231034101143 is an apocalyptic number.
10231034101143 is a deficient number, since it is larger than the sum of its proper divisors (3410344700385).
10231034101143 is an equidigital number, since it uses as much as digits as its factorization.
10231034101143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3410344700384.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10231034101143 its reverse (34110143013201), we get a palindrome (44341177114344).
The spelling of 10231034101143 in words is "ten trillion, two hundred thirty-one billion, thirty-four million, one hundred one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •