Base | Representation |
---|---|
bin | 1001011001111111101111… |
… | …1010010101110100011111 |
3 | 1100121201001120201102001120 |
4 | 2112133323322111310133 |
5 | 2323421322420001130 |
6 | 33555051421542023 |
7 | 2115125446052043 |
oct | 226377372256437 |
9 | 40551046642046 |
10 | 10342212656415 |
11 | 3328120472922 |
12 | 11b0482114913 |
13 | 5a036057ca23 |
14 | 27a7cc652023 |
15 | 12e0584a5910 |
hex | 967fbe95d1f |
10342212656415 has 64 divisors (see below), whose sum is σ = 17551931696640. Its totient is φ = 5191194032640.
The previous prime is 10342212656411. The next prime is 10342212656431. The reversal of 10342212656415 is 51465621224301.
It is not a de Polignac number, because 10342212656415 - 22 = 10342212656411 is a prime.
It is a super-2 number, since 2×103422126564152 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10342212656411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8621109 + ... + 9747201.
It is an arithmetic number, because the mean of its divisors is an integer number (274248932760).
Almost surely, 210342212656415 is an apocalyptic number.
10342212656415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10342212656415 is a deficient number, since it is larger than the sum of its proper divisors (7209719040225).
10342212656415 is a wasteful number, since it uses less digits than its factorization.
10342212656415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1126664.
The product of its (nonzero) digits is 345600, while the sum is 42.
The spelling of 10342212656415 in words is "ten trillion, three hundred forty-two billion, two hundred twelve million, six hundred fifty-six thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •