Base | Representation |
---|---|
bin | 1001000110001101001111… |
… | …1110000010110010011110 |
3 | 1022102012112022102020112101 |
4 | 2101203103332002302132 |
5 | 2302334041432401024 |
6 | 33134544330355314 |
7 | 2051431556150260 |
oct | 221432376026236 |
9 | 38365468366471 |
10 | 10002240122014 |
11 | 3206a20877928 |
12 | 1156601b8bb3a |
13 | 5772902970ca |
14 | 26817a851b30 |
15 | 1252ab937c44 |
hex | 918d3f82c9e |
10002240122014 has 8 divisors (see below), whose sum is σ = 17146697352048. Its totient is φ = 4286674338000.
The previous prime is 10002240122009. The next prime is 10002240122047. The reversal of 10002240122014 is 41022104220001.
10002240122014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10002240121982 and 10002240122000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 357222861487 + ... + 357222861514.
It is an arithmetic number, because the mean of its divisors is an integer number (2143337169006).
Almost surely, 210002240122014 is an apocalyptic number.
10002240122014 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10002240122014 is a deficient number, since it is larger than the sum of its proper divisors (7144457230034).
10002240122014 is an equidigital number, since it uses as much as digits as its factorization.
10002240122014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 714445723010.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 10002240122014 its reverse (41022104220001), we get a palindrome (51024344342015).
The spelling of 10002240122014 in words is "ten trillion, two billion, two hundred forty million, one hundred twenty-two thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •