Base | Representation |
---|---|
bin | 10110110010111010000111… |
… | …101110100111011001110101 |
3 | 111010222022201110120012201210 |
4 | 112302322013232213121311 |
5 | 101120041031331024123 |
6 | 553120410251512033 |
7 | 30055133236302036 |
oct | 2662720756473165 |
9 | 433868643505653 |
10 | 100255403767413 |
11 | 29a43094856904 |
12 | b2b2203a58619 |
13 | 43c30758c3a3b |
14 | 1aa855d18aa8d |
15 | b8cd16be9e93 |
hex | 5b2e87ba7675 |
100255403767413 has 8 divisors (see below), whose sum is σ = 136517996619648. Its totient is φ = 65414873380064.
The previous prime is 100255403767381. The next prime is 100255403767433. The reversal of 100255403767413 is 314767304552001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100255403767413 - 25 = 100255403767381 is a prime.
It is a super-2 number, since 2×1002554037674132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100255403767433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 355515616056 + ... + 355515616337.
It is an arithmetic number, because the mean of its divisors is an integer number (17064749577456).
Almost surely, 2100255403767413 is an apocalyptic number.
It is an amenable number.
100255403767413 is a deficient number, since it is larger than the sum of its proper divisors (36262592852235).
100255403767413 is an equidigital number, since it uses as much as digits as its factorization.
100255403767413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 711031232443.
The product of its (nonzero) digits is 2116800, while the sum is 48.
The spelling of 100255403767413 in words is "one hundred trillion, two hundred fifty-five billion, four hundred three million, seven hundred sixty-seven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •