Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11100101010001111 |
3 | 222001222101211020222 |
4 | 21122011130222033 |
5 | 131141413442033 |
6 | 4350202101555 |
7 | 505214510426 |
oct | 113205345217 |
9 | 28058354228 |
10 | 10101312143 |
11 | 4313a2235a |
12 | 1b5aaaa8bb |
13 | c4c9a02a0 |
14 | 6bb7b62bd |
15 | 3e1c21598 |
hex | 25a15ca8f |
10101312143 has 16 divisors (see below), whose sum is σ = 11008853856. Its totient is φ = 9213035520.
The previous prime is 10101312139. The next prime is 10101312167. The reversal of 10101312143 is 34121310101.
10101312143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10101312143 - 22 = 10101312139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101312113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 384071 + ... + 409527.
It is an arithmetic number, because the mean of its divisors is an integer number (688053366).
Almost surely, 210101312143 is an apocalyptic number.
10101312143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10101312143 is a deficient number, since it is larger than the sum of its proper divisors (907541713).
10101312143 is a wasteful number, since it uses less digits than its factorization.
10101312143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25834.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10101312143 its reverse (34121310101), we get a palindrome (44222622244).
The spelling of 10101312143 in words is "ten billion, one hundred one million, three hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •