Base | Representation |
---|---|
bin | 1010001010001001110… |
… | …11111110001001010111 |
3 | 1020100221211010110121012 |
4 | 11011010323332021113 |
5 | 21204323011011321 |
6 | 424203441442435 |
7 | 34134520614116 |
oct | 5050473761127 |
9 | 1210854113535 |
10 | 349048922711 |
11 | 125038020965 |
12 | 5779394041b |
13 | 26bb88303b8 |
14 | 12c7341bc7d |
15 | 912d7d805b |
hex | 5144efe257 |
349048922711 has 2 divisors, whose sum is σ = 349048922712. Its totient is φ = 349048922710.
The previous prime is 349048922693. The next prime is 349048922723. The reversal of 349048922711 is 117229840943.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 349048922711 - 238 = 74171015767 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 349048922711.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (349048222711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 174524461355 + 174524461356.
It is an arithmetic number, because the mean of its divisors is an integer number (174524461356).
Almost surely, 2349048922711 is an apocalyptic number.
349048922711 is a deficient number, since it is larger than the sum of its proper divisors (1).
349048922711 is an equidigital number, since it uses as much as digits as its factorization.
349048922711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 870912, while the sum is 50.
The spelling of 349048922711 in words is "three hundred forty-nine billion, forty-eight million, nine hundred twenty-two thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •