Base | Representation |
---|---|
bin | 1010001010100101000… |
… | …01111000100000011101 |
3 | 1020101112201020012122221 |
4 | 11011102201320200131 |
5 | 21210304400334033 |
6 | 424242225305341 |
7 | 34143260134123 |
oct | 5052241704035 |
9 | 1211481205587 |
10 | 349276964893 |
11 | 12514481737a |
12 | 57838195251 |
13 | 26c23b554bc |
14 | 12c9581d913 |
15 | 914383112d |
hex | 515287881d |
349276964893 has 4 divisors (see below), whose sum is σ = 349319397148. Its totient is φ = 349234532640.
The previous prime is 349276964891. The next prime is 349276965017. The reversal of 349276964893 is 398469672943.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 398469672943 = 149 ⋅2674293107.
It can be written as a sum of positive squares in 2 ways, for example, as 47368475449 + 301908489444 = 217643^2 + 549462^2 .
It is a cyclic number.
It is not a de Polignac number, because 349276964893 - 21 = 349276964891 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (349276964891) 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, 21203778 + ... + 21220243.
It is an arithmetic number, because the mean of its divisors is an integer number (87329849287).
Almost surely, 2349276964893 is an apocalyptic number.
It is an amenable number.
349276964893 is a deficient number, since it is larger than the sum of its proper divisors (42432255).
349276964893 is an equidigital number, since it uses as much as digits as its factorization.
349276964893 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42432254.
The product of its digits is 423263232, while the sum is 70.
The spelling of 349276964893 in words is "three hundred forty-nine billion, two hundred seventy-six million, nine hundred sixty-four thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •