Base | Representation |
---|---|
bin | 1001011010000011001000… |
… | …0000011011101100101101 |
3 | 1100121210101211110120101120 |
4 | 2112200302000123230231 |
5 | 2323430202234114041 |
6 | 33555321442131153 |
7 | 2115160106203605 |
oct | 226406200335455 |
9 | 40553354416346 |
10 | 10343120223021 |
11 | 33285467a3073 |
12 | 11b0696050ab9 |
13 | 5a04765c54a1 |
14 | 27a876dbbc05 |
15 | 12e0acec9366 |
hex | 9683201bb2d |
10343120223021 has 32 divisors (see below), whose sum is σ = 13965320214528. Its totient is φ = 6808557902400.
The previous prime is 10343120222989. The next prime is 10343120223031. The reversal of 10343120223021 is 12032202134301.
It is not a de Polignac number, because 10343120223021 - 25 = 10343120222989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10343120222982 and 10343120223000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10343120223031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 227663910 + ... + 227709336.
It is an arithmetic number, because the mean of its divisors is an integer number (436416256704).
Almost surely, 210343120223021 is an apocalyptic number.
It is an amenable number.
10343120223021 is a deficient number, since it is larger than the sum of its proper divisors (3622199991507).
10343120223021 is a wasteful number, since it uses less digits than its factorization.
10343120223021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47561.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10343120223021 its reverse (12032202134301), we get a palindrome (22375322357322).
The spelling of 10343120223021 in words is "ten trillion, three hundred forty-three billion, one hundred twenty million, two hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •