Base | Representation |
---|---|
bin | 1001010001111101011001… |
… | …0001110110000010110100 |
3 | 1100010111200020001002212202 |
4 | 2110133112101312002310 |
5 | 2314141040414030121 |
6 | 33411415051404032 |
7 | 2102140105461254 |
oct | 224372621660264 |
9 | 40114606032782 |
10 | 10204142330036 |
11 | 3284609362076 |
12 | 118976a753618 |
13 | 590328710b55 |
14 | 273c51413964 |
15 | 12a676da440b |
hex | 947d64760b4 |
10204142330036 has 6 divisors (see below), whose sum is σ = 17857249077570. Its totient is φ = 5102071165016.
The previous prime is 10204142330009. The next prime is 10204142330047. The reversal of 10204142330036 is 63003324140201.
It can be written as a sum of positive squares in only one way, i.e., 10184906304400 + 19236025636 = 3191380^2 + 138694^2 .
It is a super-2 number, since 2×102041423300362 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10204142329990 and 10204142330008.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1275517791251 + ... + 1275517791258.
It is an arithmetic number, because the mean of its divisors is an integer number (2976208179595).
Almost surely, 210204142330036 is an apocalyptic number.
It is an amenable number.
10204142330036 is a deficient number, since it is larger than the sum of its proper divisors (7653106747534).
10204142330036 is a wasteful number, since it uses less digits than its factorization.
10204142330036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2551035582513 (or 2551035582511 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 10204142330036 its reverse (63003324140201), we get a palindrome (73207466470237).
The spelling of 10204142330036 in words is "ten trillion, two hundred four billion, one hundred forty-two million, three hundred thirty thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •