Base | Representation |
---|---|
bin | 100111000001011001100101… |
… | …1000011111101111100010101 |
3 | 1200000022102110200101212101222 |
4 | 1032002303023003331330111 |
5 | 324442121021342222013 |
6 | 3214002141340500125 |
7 | 132204162334640420 |
oct | 11602631303757425 |
9 | 1600272420355358 |
10 | 343240013242133 |
11 | 9a4042aa254517 |
12 | 325b6269b4a645 |
13 | 1196a518559377 |
14 | 60a8c961429b7 |
15 | 29a36d8e94508 |
hex | 1382ccb0fdf15 |
343240013242133 has 16 divisors (see below), whose sum is σ = 399716105564160. Its totient is φ = 288644199293616.
The previous prime is 343240013242129. The next prime is 343240013242211. The reversal of 343240013242133 is 331242310042343.
It is a cyclic number.
It is not a de Polignac number, because 343240013242133 - 22 = 343240013242129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 343240013242093 and 343240013242102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343240003242133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 825925085 + ... + 826340562.
It is an arithmetic number, because the mean of its divisors is an integer number (24982256597760).
Almost surely, 2343240013242133 is an apocalyptic number.
It is an amenable number.
343240013242133 is a deficient number, since it is larger than the sum of its proper divisors (56476092322027).
343240013242133 is a wasteful number, since it uses less digits than its factorization.
343240013242133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1652266216.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 343240013242133 its reverse (331242310042343), we get a palindrome (674482323284476).
The spelling of 343240013242133 in words is "three hundred forty-three trillion, two hundred forty billion, thirteen million, two hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •