Base | Representation |
---|---|
bin | 10010110110101000… |
… | …11100100100010111 |
3 | 222010102100221122222 |
4 | 21123110130210113 |
5 | 131212214134033 |
6 | 4352222012555 |
7 | 505555521503 |
oct | 113324344427 |
9 | 28112327588 |
10 | 10122021143 |
11 | 4324687333 |
12 | 1b65a1715b |
13 | c54071330 |
14 | 6c0447303 |
15 | 3e3962598 |
hex | 25b51c917 |
10122021143 has 16 divisors (see below), whose sum is σ = 11406509856. Its totient is φ = 8919331200.
The previous prime is 10122021139. The next prime is 10122021157. The reversal of 10122021143 is 34112022101.
10122021143 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 10122021143 - 22 = 10122021139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122021103) 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, 173033 + ... + 224018.
It is an arithmetic number, because the mean of its divisors is an integer number (712906866).
Almost surely, 210122021143 is an apocalyptic number.
10122021143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10122021143 is a deficient number, since it is larger than the sum of its proper divisors (1284488713).
10122021143 is a wasteful number, since it uses less digits than its factorization.
10122021143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397154.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 10122021143 its reverse (34112022101), we get a palindrome (44234043244).
The spelling of 10122021143 in words is "ten billion, one hundred twenty-two million, twenty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •