Base | Representation |
---|---|
bin | 1001111111010011001… |
… | …01000011001011000010 |
3 | 1012210220200021111102022 |
4 | 10333221211003023002 |
5 | 21110404113020114 |
6 | 421401301521442 |
7 | 33540225143240 |
oct | 4775145031302 |
9 | 1183820244368 |
10 | 343221220034 |
11 | 122617481660 |
12 | 56628113282 |
13 | 2649a36c514 |
14 | 1287d45d790 |
15 | 8ddbd8648e |
hex | 4fe99432c2 |
343221220034 has 64 divisors (see below), whose sum is σ = 657045430272. Its totient is φ = 130563014400.
The previous prime is 343221220031. The next prime is 343221220037. The reversal of 343221220034 is 430022122343.
It is an interprime number because it is at equal distance from previous prime (343221220031) and next prime (343221220037).
It is a super-2 number, since 2×3432212200342 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 343221219985 and 343221220012.
It is not an unprimeable number, because it can be changed into a prime (343221220031) 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, 20658959 + ... + 20675565.
It is an arithmetic number, because the mean of its divisors is an integer number (10266334848).
Almost surely, 2343221220034 is an apocalyptic number.
343221220034 is a deficient number, since it is larger than the sum of its proper divisors (313824210238).
343221220034 is a wasteful number, since it uses less digits than its factorization.
343221220034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19791.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 343221220034 its reverse (430022122343), we get a palindrome (773243342377).
The spelling of 343221220034 in words is "three hundred forty-three billion, two hundred twenty-one million, two hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •