Base | Representation |
---|---|
bin | 1001100011001101110010… |
… | …0101111011001001000001 |
3 | 1101011211212221022221210011 |
4 | 2120303130211323021001 |
5 | 2334020212324004023 |
6 | 34155524241504521 |
7 | 2132433452551021 |
oct | 230633445731101 |
9 | 41154787287704 |
10 | 10500601000513 |
11 | 3389309573058 |
12 | 1217106042141 |
13 | 5b22829623b0 |
14 | 2843360b9a81 |
15 | 1332286e050d |
hex | 98cdc97b241 |
10500601000513 has 8 divisors (see below), whose sum is σ = 11326260846656. Its totient is φ = 9677501341200.
The previous prime is 10500601000511. The next prime is 10500601000531. The reversal of 10500601000513 is 31500010600501.
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 10500601000513 - 21 = 10500601000511 is a prime.
It is a super-2 number, since 2×105006010005132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10500601000511) 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, 640038183 + ... + 640054588.
It is an arithmetic number, because the mean of its divisors is an integer number (1415782605832).
Almost surely, 210500601000513 is an apocalyptic number.
10500601000513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10500601000513 is a deficient number, since it is larger than the sum of its proper divisors (825659846143).
10500601000513 is a wasteful number, since it uses less digits than its factorization.
10500601000513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1280093415.
The product of its (nonzero) digits is 450, while the sum is 22.
The spelling of 10500601000513 in words is "ten trillion, five hundred billion, six hundred one million, five hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •