Base | Representation |
---|---|
bin | 1001010011010010110001… |
… | …0101101110101100101100 |
3 | 1100012200211110121110201110 |
4 | 2110310230111232230230 |
5 | 2320030010110304310 |
6 | 33430125202512020 |
7 | 2103611051252520 |
oct | 224645425565454 |
9 | 40180743543643 |
10 | 10227061025580 |
11 | 32932aa36a273 |
12 | 11920a6065610 |
13 | 59253b9a3c69 |
14 | 274dc71b9d80 |
15 | 12b068ea3d20 |
hex | 94d2c56eb2c |
10227061025580 has 48 divisors (see below), whose sum is σ = 32726595283200. Its totient is φ = 2337613948608.
The previous prime is 10227061025567. The next prime is 10227061025591. The reversal of 10227061025580 is 8552016072201.
10227061025580 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12175072230 + ... + 12175073069.
It is an arithmetic number, because the mean of its divisors is an integer number (681804068400).
Almost surely, 210227061025580 is an apocalyptic number.
10227061025580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10227061025580 is an abundant number, since it is smaller than the sum of its proper divisors (22499534257620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10227061025580 is a wasteful number, since it uses less digits than its factorization.
10227061025580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24350145318 (or 24350145316 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 39.
Adding to 10227061025580 its reverse (8552016072201), we get a palindrome (18779077097781).
The spelling of 10227061025580 in words is "ten trillion, two hundred twenty-seven billion, sixty-one million, twenty-five thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •