Base | Representation |
---|---|
bin | 1001010001101111100100… |
… | …1001101000101100000001 |
3 | 1100010011002200011211001102 |
4 | 2110123321021220230001 |
5 | 2314110441144212231 |
6 | 33410003003144145 |
7 | 2101646136633014 |
oct | 224337111505401 |
9 | 40104080154042 |
10 | 10200432413441 |
11 | 3282a851998a6 |
12 | 1188ab4215055 |
13 | 58cb86c2762a |
14 | 2739bc81137b |
15 | 12a50b32eacb |
hex | 946f9268b01 |
10200432413441 has 8 divisors (see below), whose sum is σ = 10210579385760. Its totient is φ = 10190289970912.
The previous prime is 10200432413417. The next prime is 10200432413443. The reversal of 10200432413441 is 14431423400201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10200432413441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200432413443) 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, 3382445 + ... + 5642853.
It is an arithmetic number, because the mean of its divisors is an integer number (1276322423220).
Almost surely, 210200432413441 is an apocalyptic number.
It is an amenable number.
10200432413441 is a deficient number, since it is larger than the sum of its proper divisors (10146972319).
10200432413441 is a wasteful number, since it uses less digits than its factorization.
10200432413441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2264895.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 10200432413441 its reverse (14431423400201), we get a palindrome (24631855813642).
The spelling of 10200432413441 in words is "ten trillion, two hundred billion, four hundred thirty-two million, four hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •