Base | Representation |
---|---|
bin | 1001010001111011011100… |
… | …1101100111000011010100 |
3 | 1100010110022220022012211202 |
4 | 2110132313031213003110 |
5 | 2314134004002020411 |
6 | 33411251232252032 |
7 | 2102121146353100 |
oct | 224366715470324 |
9 | 40113286265752 |
10 | 10203621126356 |
11 | 3284371133029 |
12 | 11896440a1018 |
13 | 5902747437c8 |
14 | 273c020dc900 |
15 | 12a64624d83b |
hex | 947b73670d4 |
10203621126356 has 36 divisors (see below), whose sum is σ = 20821231821600. Its totient is φ = 4362543740016.
The previous prime is 10203621126343. The next prime is 10203621126389. The reversal of 10203621126356 is 65362112630201.
It is a super-2 number, since 2×102036211263562 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 62041136 + ... + 62205383.
It is an arithmetic number, because the mean of its divisors is an integer number (578367550600).
Almost surely, 210203621126356 is an apocalyptic number.
It is an amenable number.
10203621126356 is an abundant number, since it is smaller than the sum of its proper divisors (10617610695244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10203621126356 is a wasteful number, since it uses less digits than its factorization.
10203621126356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124246956 (or 124246947 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 10203621126356 its reverse (65362112630201), we get a palindrome (75565733756557).
The spelling of 10203621126356 in words is "ten trillion, two hundred three billion, six hundred twenty-one million, one hundred twenty-six thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •