Base | Representation |
---|---|
bin | 10110110010010000001110… |
… | …000101101010010110111001 |
3 | 111010211000121000002110012110 |
4 | 112302100032011222112321 |
5 | 101113321411302044023 |
6 | 553044010042202533 |
7 | 30051651313621554 |
oct | 2662201605522671 |
9 | 433730530073173 |
10 | 100210413315513 |
11 | 29a25aa7922456 |
12 | b2a55487b3449 |
13 | 43bba55976877 |
14 | 1aa62d1cc569b |
15 | b8ba82045a93 |
hex | 5b240e16a5b9 |
100210413315513 has 4 divisors (see below), whose sum is σ = 133613884420688. Its totient is φ = 66806942210340.
The previous prime is 100210413315469. The next prime is 100210413315569. The reversal of 100210413315513 is 315513314012001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 100210413315513 - 218 = 100210413053369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100210413311513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16701735552583 + ... + 16701735552588.
It is an arithmetic number, because the mean of its divisors is an integer number (33403471105172).
Almost surely, 2100210413315513 is an apocalyptic number.
It is an amenable number.
100210413315513 is a deficient number, since it is larger than the sum of its proper divisors (33403471105175).
100210413315513 is an equidigital number, since it uses as much as digits as its factorization.
100210413315513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33403471105174.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 100210413315513 its reverse (315513314012001), we get a palindrome (415723727327514).
The spelling of 100210413315513 in words is "one hundred trillion, two hundred ten billion, four hundred thirteen million, three hundred fifteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •