Base | Representation |
---|---|
bin | 10011010000011001… |
… | …01110001110101101 |
3 | 222200110221220022211 |
4 | 21220030232032231 |
5 | 132133023201031 |
6 | 4425501210421 |
7 | 514121254435 |
oct | 115014561655 |
9 | 28613856284 |
10 | 10338100141 |
11 | 4425651716 |
12 | 2006260a11 |
13 | c89a68125 |
14 | 7010132c5 |
15 | 4078e5bb1 |
hex | 26832e3ad |
10338100141 has 8 divisors (see below), whose sum is σ = 10379909504. Its totient is φ = 10296318240.
The previous prime is 10338100093. The next prime is 10338100147. The reversal of 10338100141 is 14100183301.
10338100141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10338100141 - 215 = 10338067373 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 (10338100147) 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 7 ways as a sum of consecutive naturals, for example, 1094746 + ... + 1104148.
It is an arithmetic number, because the mean of its divisors is an integer number (1297488688).
Almost surely, 210338100141 is an apocalyptic number.
It is an amenable number.
10338100141 is a deficient number, since it is larger than the sum of its proper divisors (41809363).
10338100141 is an equidigital number, since it uses as much as digits as its factorization.
10338100141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13731.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10338100141 its reverse (14100183301), we get a palindrome (24438283442).
The spelling of 10338100141 in words is "ten billion, three hundred thirty-eight million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •