Base | Representation |
---|---|
bin | 10011001111011100… |
… | …10101011101000101 |
3 | 222122220222012022012 |
4 | 21213232111131011 |
5 | 132124003244331 |
6 | 4425014344005 |
7 | 513663456512 |
oct | 114756253505 |
9 | 28586865265 |
10 | 10330134341 |
11 | 442110090a |
12 | 200365b005 |
13 | c88209437 |
14 | 6ddd3c309 |
15 | 406d7082b |
hex | 267b95745 |
10330134341 has 8 divisors (see below), whose sum is σ = 10687478520. Its totient is φ = 9972865728.
The previous prime is 10330134323. The next prime is 10330134427. The reversal of 10330134341 is 14343103301.
It can be written as a sum of positive squares in 4 ways, for example, as 62568100 + 10267566241 = 7910^2 + 101329^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10330134341 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 (10330131341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 527375 + ... + 546611.
It is an arithmetic number, because the mean of its divisors is an integer number (1335934815).
Almost surely, 210330134341 is an apocalyptic number.
It is an amenable number.
10330134341 is a deficient number, since it is larger than the sum of its proper divisors (357344179).
10330134341 is a wasteful number, since it uses less digits than its factorization.
10330134341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37783.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10330134341 its reverse (14343103301), we get a palindrome (24673237642).
The spelling of 10330134341 in words is "ten billion, three hundred thirty million, one hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •