Base | Representation |
---|---|
bin | 1001010010011110011100… |
… | …0100110001011010101001 |
3 | 1100011100120111202012102011 |
4 | 2110213213010301122221 |
5 | 2314312223044103343 |
6 | 33415443251235521 |
7 | 2102603003035363 |
oct | 224474704613251 |
9 | 40140514665364 |
10 | 10213014050473 |
11 | 32883511a6a33 |
12 | 118b4258a8ba1 |
13 | 591110728780 |
14 | 274453795d33 |
15 | 12a9e5b9229d |
hex | 949e71316a9 |
10213014050473 has 8 divisors (see below), whose sum is σ = 11476831843008. Its totient is φ = 9017510733264.
The previous prime is 10213014050467. The next prime is 10213014050513. The reversal of 10213014050473 is 37405041031201.
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 10213014050473 - 213 = 10213014042281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10213014050413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17078618515 + ... + 17078619112.
It is an arithmetic number, because the mean of its divisors is an integer number (1434603980376).
Almost surely, 210213014050473 is an apocalyptic number.
10213014050473 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10213014050473 is a deficient number, since it is larger than the sum of its proper divisors (1263817792535).
10213014050473 is a wasteful number, since it uses less digits than its factorization.
10213014050473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34157237663.
The product of its (nonzero) digits is 10080, while the sum is 31.
Adding to 10213014050473 its reverse (37405041031201), we get a palindrome (47618055081674).
The spelling of 10213014050473 in words is "ten trillion, two hundred thirteen billion, fourteen million, fifty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •