Base | Representation |
---|---|
bin | 1001100101001011100011… |
… | …0010110100110011011110 |
3 | 1101022002000200002222111112 |
4 | 2121102320302310303132 |
5 | 2340043332144003042 |
6 | 34223230201222022 |
7 | 2135040156531134 |
oct | 231227062646336 |
9 | 41262020088445 |
10 | 10534360141022 |
11 | 33a166273aa83 |
12 | 1221767a91912 |
13 | 5b5502a86a93 |
14 | 285c1989b754 |
15 | 134052363982 |
hex | 994b8cb4cde |
10534360141022 has 8 divisors (see below), whose sum is σ = 15809444940000. Its totient is φ = 5264545161024.
The previous prime is 10534360141009. The next prime is 10534360141127. The reversal of 10534360141022 is 22014106343501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×105343601410222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10534360141022.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1317449747 + ... + 1317457742.
It is an arithmetic number, because the mean of its divisors is an integer number (1976180617500).
Almost surely, 210534360141022 is an apocalyptic number.
10534360141022 is a deficient number, since it is larger than the sum of its proper divisors (5275084798978).
10534360141022 is a wasteful number, since it uses less digits than its factorization.
10534360141022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2634909490.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 10534360141022 its reverse (22014106343501), we get a palindrome (32548466484523).
The spelling of 10534360141022 in words is "ten trillion, five hundred thirty-four billion, three hundred sixty million, one hundred forty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •