Base | Representation |
---|---|
bin | 1001011010000011100000… |
… | …1101100100011101010101 |
3 | 1100121210200002100202102011 |
4 | 2112200320031210131111 |
5 | 2323430410412030234 |
6 | 33555340041344221 |
7 | 2115162512122651 |
oct | 226407015443525 |
9 | 40553602322364 |
10 | 10343224330069 |
11 | 332859a53a254 |
12 | 11b0704a98071 |
13 | 5a04920464a7 |
14 | 27a886b5ba61 |
15 | 12e0b71e0b64 |
hex | 96838364755 |
10343224330069 has 2 divisors, whose sum is σ = 10343224330070. Its totient is φ = 10343224330068.
The previous prime is 10343224330009. The next prime is 10343224330091. The reversal of 10343224330069 is 96003342234301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9849209339025 + 494014991044 = 3138345^2 + 702862^2 .
It is an emirp because it is prime and its reverse (96003342234301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10343224330069 - 225 = 10343190775637 is a prime.
It is a super-2 number, since 2×103432243300692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10343224330009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5171612165034 + 5171612165035.
It is an arithmetic number, because the mean of its divisors is an integer number (5171612165035).
Almost surely, 210343224330069 is an apocalyptic number.
It is an amenable number.
10343224330069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10343224330069 is an equidigital number, since it uses as much as digits as its factorization.
10343224330069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 279936, while the sum is 40.
The spelling of 10343224330069 in words is "ten trillion, three hundred forty-three billion, two hundred twenty-four million, three hundred thirty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •