Base | Representation |
---|---|
bin | 10011001110100000… |
… | …01110001010001101 |
3 | 222122101010010111102 |
4 | 21213100032022031 |
5 | 132114443141031 |
6 | 4424133232445 |
7 | 513536410403 |
oct | 114720161215 |
9 | 28571103442 |
10 | 10322240141 |
11 | 44176a9884 |
12 | 2000a92725 |
13 | c866a4205 |
14 | 6dcc85473 |
15 | 4063117cb |
hex | 26740e28d |
10322240141 has 4 divisors (see below), whose sum is σ = 10328905500. Its totient is φ = 10315574784.
The previous prime is 10322240129. The next prime is 10322240147. The reversal of 10322240141 is 14104222301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14104222301 = 13 ⋅1084940177.
It can be written as a sum of positive squares in 2 ways, for example, as 1387264516 + 8934975625 = 37246^2 + 94525^2 .
It is a cyclic number.
It is not a de Polignac number, because 10322240141 - 230 = 9248498317 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 (10322240147) 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, 3330356 + ... + 3333453.
It is an arithmetic number, because the mean of its divisors is an integer number (2582226375).
Almost surely, 210322240141 is an apocalyptic number.
It is an amenable number.
10322240141 is a deficient number, since it is larger than the sum of its proper divisors (6665359).
10322240141 is an equidigital number, since it uses as much as digits as its factorization.
10322240141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6665358.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 10322240141 its reverse (14104222301), we get a palindrome (24426462442).
The spelling of 10322240141 in words is "ten billion, three hundred twenty-two million, two hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •