Base | Representation |
---|---|
bin | 1001011010000011100000… |
… | …0101000111100000100110 |
3 | 1100121210122221012012000012 |
4 | 2112200320011013200212 |
5 | 2323430404330124332 |
6 | 33555335522050222 |
7 | 2115162454234055 |
oct | 226407005074046 |
9 | 40553587165005 |
10 | 10343222114342 |
11 | 3328599266577 |
12 | 11b07041a9972 |
13 | 5a049174bb00 |
14 | 27a88674239c |
15 | 12e0b6e043b2 |
hex | 96838147826 |
10343222114342 has 12 divisors (see below), whose sum is σ = 16800085624140. Its totient is φ = 4773794821848.
The previous prime is 10343222114311. The next prime is 10343222114363. The reversal of 10343222114342 is 24341122234301.
It is a happy number.
It is a super-2 number, since 2×103432221143422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10343222114299 and 10343222114308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15300624092 + ... + 15300624767.
It is an arithmetic number, because the mean of its divisors is an integer number (1400007135345).
Almost surely, 210343222114342 is an apocalyptic number.
10343222114342 is a deficient number, since it is larger than the sum of its proper divisors (6456863509798).
10343222114342 is a wasteful number, since it uses less digits than its factorization.
10343222114342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30601248887 (or 30601248874 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 10343222114342 its reverse (24341122234301), we get a palindrome (34684344348643).
The spelling of 10343222114342 in words is "ten trillion, three hundred forty-three billion, two hundred twenty-two million, one hundred fourteen thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •