Base | Representation |
---|---|
bin | 1001010001111101000001… |
… | …0000111100110100001100 |
3 | 1100010111102012011222020202 |
4 | 2110133100100330310030 |
5 | 2314140334101313312 |
6 | 33411401045033032 |
7 | 2102134442036666 |
oct | 224372020746414 |
9 | 40114365158222 |
10 | 10204041432332 |
11 | 3284567408140 |
12 | 11897409b5778 |
13 | 590310844877 |
14 | 273c41c6b536 |
15 | 12a66d0c39c2 |
hex | 947d043cd0c |
10204041432332 has 192 divisors, whose sum is σ = 21340138659840. Its totient is φ = 4219154956800.
The previous prime is 10204041432331. The next prime is 10204041432391. The reversal of 10204041432332 is 23323414040201.
It is a junction number, because it is equal to n+sod(n) for n = 10204041432295 and 10204041432304.
It is not an unprimeable number, because it can be changed into a prime (10204041432331) 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 63 ways as a sum of consecutive naturals, for example, 816121193 + ... + 816133695.
It is an arithmetic number, because the mean of its divisors is an integer number (111146555520).
Almost surely, 210204041432332 is an apocalyptic number.
It is an amenable number.
10204041432332 is an abundant number, since it is smaller than the sum of its proper divisors (11136097227508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10204041432332 is a wasteful number, since it uses less digits than its factorization.
10204041432332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12964 (or 12962 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 10204041432332 its reverse (23323414040201), we get a palindrome (33527455472533).
The spelling of 10204041432332 in words is "ten trillion, two hundred four billion, forty-one million, four hundred thirty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •