Base | Representation |
---|---|
bin | 10010101110100111… |
… | …10001100101101110 |
3 | 221221201202112010110 |
4 | 21113103301211232 |
5 | 131043003024423 |
6 | 4341415520450 |
7 | 504110563551 |
oct | 112723614556 |
9 | 27851675113 |
10 | 10054736238 |
11 | 429a700178 |
12 | 1b47389126 |
13 | c43143591 |
14 | 6b5530698 |
15 | 3dcac1193 |
hex | 2574f196e |
10054736238 has 8 divisors (see below), whose sum is σ = 20109472488. Its totient is φ = 3351578744.
The previous prime is 10054736233. The next prime is 10054736243. The reversal of 10054736238 is 83263745001.
It is an interprime number because it is at equal distance from previous prime (10054736233) and next prime (10054736243).
It is a sphenic number, since it is the product of 3 distinct primes.
10054736238 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10054736196 and 10054736205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10054736233) 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 3 ways as a sum of consecutive naturals, for example, 837894681 + ... + 837894692.
It is an arithmetic number, because the mean of its divisors is an integer number (2513684061).
Almost surely, 210054736238 is an apocalyptic number.
10054736238 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10054736238 is a wasteful number, since it uses less digits than its factorization.
10054736238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675789378.
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 10054736238 in words is "ten billion, fifty-four million, seven hundred thirty-six thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •