Base | Representation |
---|---|
bin | 1001000110110011010010… |
… | …0001110000101110001001 |
3 | 1022110011212212011102201222 |
4 | 2101230310201300232021 |
5 | 2303020444202020041 |
6 | 33143353412251425 |
7 | 2052242563024226 |
oct | 221546441605611 |
9 | 38404785142658 |
10 | 10012450032521 |
11 | 32102900237a2 |
12 | 1158591310b75 |
13 | 5782295cb781 |
14 | 26886881694d |
15 | 1256a7e5b74b |
hex | 91b34870b89 |
10012450032521 has 8 divisors (see below), whose sum is σ = 10204673258880. Its totient is φ = 9820349364592.
The previous prime is 10012450032467. The next prime is 10012450032583. The reversal of 10012450032521 is 12523005421001.
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 10012450032521 - 210 = 10012450031497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10012450032121) 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, 30474641 + ... + 30801438.
It is an arithmetic number, because the mean of its divisors is an integer number (1275584157360).
Almost surely, 210012450032521 is an apocalyptic number.
It is an amenable number.
10012450032521 is a deficient number, since it is larger than the sum of its proper divisors (192223226359).
10012450032521 is an equidigital number, since it uses as much as digits as its factorization.
10012450032521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61279215.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10012450032521 its reverse (12523005421001), we get a palindrome (22535455453522).
The spelling of 10012450032521 in words is "ten trillion, twelve billion, four hundred fifty million, thirty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •