Base | Representation |
---|---|
bin | 10011001111111101… |
… | …01010000100110011 |
3 | 222200020000120200000 |
4 | 21213332222010303 |
5 | 132131102204412 |
6 | 4425250201043 |
7 | 514045030164 |
oct | 114776520463 |
9 | 28606016600 |
10 | 10334413107 |
11 | 4423563587 |
12 | 2004b83183 |
13 | c89076b55 |
14 | 70073376b |
15 | 4074184dc |
hex | 267faa133 |
10334413107 has 24 divisors (see below), whose sum is σ = 16153423104. Its totient is φ = 6590056968.
The previous prime is 10334413099. The next prime is 10334413109. The reversal of 10334413107 is 70131443301.
10334413107 is a `hidden beast` number, since 1 + 0 + 3 + 344 + 1 + 310 + 7 = 666.
It is not a de Polignac number, because 10334413107 - 23 = 10334413099 is a prime.
It is a super-2 number, since 2×103344131072 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10334413109) 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 23 ways as a sum of consecutive naturals, for example, 918943 + ... + 930120.
It is an arithmetic number, because the mean of its divisors is an integer number (673059296).
Almost surely, 210334413107 is an apocalyptic number.
10334413107 is a deficient number, since it is larger than the sum of its proper divisors (5819009997).
10334413107 is an equidigital number, since it uses as much as digits as its factorization.
10334413107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1849101 (or 1849089 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 10334413107 its reverse (70131443301), we get a palindrome (80465856408).
The spelling of 10334413107 in words is "ten billion, three hundred thirty-four million, four hundred thirteen thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.452 sec. • engine limits •