Base | Representation |
---|---|
bin | 1001101010010010110100… |
… | …0100101011011101110110 |
3 | 1101121110210002201200112212 |
4 | 2122210231010223131312 |
5 | 2343013241320334332 |
6 | 34331435343413422 |
7 | 2144300163005441 |
oct | 232445504533566 |
9 | 41543702650485 |
10 | 10622210324342 |
11 | 3425943897a71 |
12 | 12367a48b4272 |
13 | 5c0893398386 |
14 | 28a191062658 |
15 | 136494ad78b2 |
hex | 9a92d12b776 |
10622210324342 has 16 divisors (see below), whose sum is σ = 16345292285952. Its totient is φ = 5174793035880.
The previous prime is 10622210324317. The next prime is 10622210324347. The reversal of 10622210324342 is 24342301222601.
It is a super-2 number, since 2×106222103243422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10622210324299 and 10622210324308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10622210324347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 253347284 + ... + 253389207.
It is an arithmetic number, because the mean of its divisors is an integer number (1021580767872).
Almost surely, 210622210324342 is an apocalyptic number.
10622210324342 is a deficient number, since it is larger than the sum of its proper divisors (5723081961610).
10622210324342 is a wasteful number, since it uses less digits than its factorization.
10622210324342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506736763.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 10622210324342 its reverse (24342301222601), we get a palindrome (34964511546943).
The spelling of 10622210324342 in words is "ten trillion, six hundred twenty-two billion, two hundred ten million, three hundred twenty-four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •