Base | Representation |
---|---|
bin | 1110110010001011011100… |
… | …0011111111101000001000 |
3 | 2010112222120202101110220121 |
4 | 3230202313003333220020 |
5 | 4112311201221310030 |
6 | 54323314243433024 |
7 | 3265254456131665 |
oct | 354426703775010 |
9 | 63488522343817 |
10 | 16255227525640 |
11 | 51a7892190044 |
12 | 19a6456985774 |
13 | 90bb275a9a2c |
14 | 402a85adaa6c |
15 | 1d2c80ae147a |
hex | ec8b70ffa08 |
16255227525640 has 32 divisors (see below), whose sum is σ = 37466317105560. Its totient is φ = 6343503424000.
The previous prime is 16255227525613. The next prime is 16255227525643. The reversal of 16255227525640 is 4652572255261.
It can be written as a sum of positive squares in 4 ways, for example, as 14189068518244 + 2066159007396 = 3766838^2 + 1437414^2 .
It is not an unprimeable number, because it can be changed into a prime (16255227525643) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4955860411 + ... + 4955863690.
Almost surely, 216255227525640 is an apocalyptic number.
16255227525640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16255227525640 is an abundant number, since it is smaller than the sum of its proper divisors (21211089579920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16255227525640 is a wasteful number, since it uses less digits than its factorization.
16255227525640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9911724153 (or 9911724149 counting only the distinct ones).
The product of its (nonzero) digits is 10080000, while the sum is 52.
The spelling of 16255227525640 in words is "sixteen trillion, two hundred fifty-five billion, two hundred twenty-seven million, five hundred twenty-five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •