Base | Representation |
---|---|
bin | 1010001001010110110… |
… | …11110101101010101001 |
3 | 1020022212000001020121022 |
4 | 11010223123311222221 |
5 | 21202433443201334 |
6 | 424053155222225 |
7 | 34121104123115 |
oct | 5045333655251 |
9 | 1208760036538 |
10 | 348621068969 |
11 | 124938561028 |
12 | 576945a7975 |
13 | 26b4acb89c4 |
14 | 12c32686745 |
15 | 9105e7182e |
hex | 512b6f5aa9 |
348621068969 has 4 divisors (see below), whose sum is σ = 352821322896. Its totient is φ = 344420815044.
The previous prime is 348621068921. The next prime is 348621068977. The reversal of 348621068969 is 969860126843.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 969860126843 = 165313 ⋅5866811.
It is a cyclic number.
It is not a de Polignac number, because 348621068969 - 228 = 348352633513 is a prime.
It is a super-2 number, since 2×3486210689692 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (348621068989) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2100126839 + ... + 2100127004.
It is an arithmetic number, because the mean of its divisors is an integer number (88205330724).
Almost surely, 2348621068969 is an apocalyptic number.
It is an amenable number.
348621068969 is a deficient number, since it is larger than the sum of its proper divisors (4200253927).
348621068969 is an equidigital number, since it uses as much as digits as its factorization.
348621068969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4200253926.
The product of its (nonzero) digits is 26873856, while the sum is 62.
The spelling of 348621068969 in words is "three hundred forty-eight billion, six hundred twenty-one million, sixty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •