Base | Representation |
---|---|
bin | 1001011001100010010110… |
… | …0010001001101001111101 |
3 | 1100120221200121012221000012 |
4 | 2112120211202021221331 |
5 | 2323304142140223423 |
6 | 33551304352513005 |
7 | 2114426052223166 |
oct | 226304542115175 |
9 | 40527617187005 |
10 | 10334321023613 |
11 | 3324840891344 |
12 | 11aaa3b24b765 |
13 | 59c6a361ca12 |
14 | 27a28051676d |
15 | 12dc45764078 |
hex | 96625889a7d |
10334321023613 has 2 divisors, whose sum is σ = 10334321023614. Its totient is φ = 10334321023612.
The previous prime is 10334321023601. The next prime is 10334321023639. The reversal of 10334321023613 is 31632012343301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7264631308804 + 3069689714809 = 2695298^2 + 1752053^2 .
It is a cyclic number.
It is not a de Polignac number, because 10334321023613 - 210 = 10334321022589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10334321023613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10334321013613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5167160511806 + 5167160511807.
It is an arithmetic number, because the mean of its divisors is an integer number (5167160511807).
Almost surely, 210334321023613 is an apocalyptic number.
It is an amenable number.
10334321023613 is a deficient number, since it is larger than the sum of its proper divisors (1).
10334321023613 is an equidigital number, since it uses as much as digits as its factorization.
10334321023613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 10334321023613 its reverse (31632012343301), we get a palindrome (41966333366914).
The spelling of 10334321023613 in words is "ten trillion, three hundred thirty-four billion, three hundred twenty-one million, twenty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •